A Proof of Coincidence of Labeled Bisimilarity and Observational Equivalence in Applied Pi Calculus

However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [3]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces many possibilities and makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate semantics, originally proposed in [3], as a bridge. Four equivalences will be discussed:

[1]  Björn Victor,et al.  Psi-calculi: Mobile Processes, Nominal Data, and Logic , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[2]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[3]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[4]  Mark Ryan,et al.  Symbolic bisimulation for the applied pi calculus , 2007, J. Comput. Secur..

[5]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[6]  Jia Liu,et al.  A complete symbolic bisimulation for full applied pi calculus , 2009, Theor. Comput. Sci..