文章基本信息

标题：Recursive Ping-Pong Protocols
本地全文：下载
作者：Hans Hüttel ; Jirí Srba
期刊名称：BRICS Report Series
印刷版ISSN：0909-0878
出版年度：2003
卷号：10
期号：47
出版社：Aarhus University
摘要：This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis and bisimulation checking. Our main result is that our channel-free and memory-less calculus is Turing powerful, assuming that at least three principals are involved. We also investigate the expressive power of the calculus in the case of two participants. Here, our main results are that reachability and, under certain conditions, also strong bisimilarity become decidable.