Partial order reduction for branching security protocols

W.J. Fokkink, M. Torabi Dashti, A.J. Wijs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)

Abstract

Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are presented. The proposed algorithms are suitable for branching security protocols, e.g. optimistic fair contract signing schemes. The first extension is proved to generate a reduced state space which is branching bisimilar to the full state space, while the second extension generates a state space that is trace equivalent to the full state space. Experimental results using an implementation of the algorithms in the toolset of the µCRL process algebra are reported.
Original languageEnglish
Title of host publicationProceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010)
PublisherIEEE Computer Society
Pages191-200
ISBN (Print)978-1-4244-7266-6
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Partial order reduction for branching security protocols'. Together they form a unique fingerprint.

Cite this