A trace based bisimulation for the spi calculus: an extended abstract

Authors:
Alwen Tiu
Affiliations:
Computer Sciences Laboratory, Australian National University
Venue:
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Year:
2007

Citing 7
Cited 2

A calculus of mobile processes, II

Information and Computation
A theory of bisimulation for the &lgr;-calculus

Acta Informatica
A calculus for cryptographic protocols

Information and Computation
Proof Techniques for Cryptographic Processes

SIAM Journal on Computing
A bisimulation method for cryptographic protocols

Nordic Journal of Computing
On bisimulations for the spi calculus

Mathematical Structures in Computer Science
Open bisimulation, revisited

Theoretical Computer Science

A Proof Theoretic Analysis of Intruder Theories

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Formalising Observer Theory for Environment-Sensitive Bisimulation

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A notion of open bisimulation is formulated for the spi calculus, an extension of the π-calculus with cryptographic primitives. In this formulation, open bisimulation is indexed by pairs of symbolic traces, which represent the history of interactions between the environment with the pairs of processes being checked for bisimilarity. The use of symbolic traces allows for a symbolic treatment of bound input in bisimulation checking which avoids quantification over input values. Open bisimilarity is shown to be sound with respect to testing equivalence, and futher, it is shown to be an equivalence relation on processes and a congruence on finite processes.