Decidability Issues for Extended Ping-Pong Protocol

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

HUTTEL Hans SRBA Jiří

Year of publication 2005
Type Article in Periodical
Magazine / Source Journal of Automated Reasoning
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords ping-pong protocols; decidability; recursion; replication
Description We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we show that all nontrivial properties, including reachability and equivalence checking wrt. the whole van Glabbeek's spectrum, become undecidable for a very simple recursive extension of the protocol. The result holds even if no nondeterministic choice operator is allowed but reachability is shown to be decidable in polynomial time if only two parties are participating in the protocol. We also show that the calculus is capable of an implicit description of the active intruder, including full analysis and synthesis of messages in the sense of Amadio, Lugiez and Vanackere. We conclude by showing that reachability analysis for a replicative variant of the protocol becomes decidable.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.