Partial order reduction for branching security protocols

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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelProceedings 10th International Conference on Application of Concurrency to System Design (ACSD'10, Braga, Portugal, June 21-25, 2010)
UitgeverijIEEE Computer Society
Pagina's191-200
ISBN van geprinte versie978-1-4244-7266-6
DOI's
StatusGepubliceerd - 2010

Vingerafdruk

Duik in de onderzoeksthema's van 'Partial order reduction for branching security protocols'. Samen vormen ze een unieke vingerafdruk.

Citeer dit