Open Bisimulation, Revisited

Electronic Notes in Theoretical Computer Science

Volumn 154, Issue 3, 2006, Pages 109-123

  Briais, Sébastien ^a   Nestmann, Uwe ^b  

^a EPFL   (Switzerland)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

calculus; open bisimulation; spi calculus

Indexed keywords

COMPUTER SIMULATION; NUMERICAL METHODS;

Π-CALCULUS; OPEN BISIMULATION; SPI-CALCULUS;

DIFFERENTIATION (CALCULUS);

EID: 33745869820     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.05.010     Document Type: Article

References (12)

1. Abadi M., and Gordon A.D. A Bisimulation Method for Cryptographic Protocols. Nordic Journal of Computing 5 4 (Winter 1998) 267-303
2. An extended abstract appeared in the Proceedings of ESOP '98, LNCS 1381, pages 12-26
3. Borgström J., Briais S., and Nestmann U. Symbolic Bisimulation in the Spi Calculus. In: Gardner P., and Yoshida N. (Eds). Proceedings of CONCUR 2004. LNCS volume 3170 (Sept. 2004), Springer Verlag 161-176
4. Borgström J., and Nestmann U. On Bisimulations for the Spi Calculus. Mathematical Structures in Computer Science 15 (2005) 487-552
5. S. Briais. Towards open bisimulation in the spi calculus. Mémoire de D.E.A., Université Paris VII - Denis Diderot, 2002
6. Briais S. ABC Bisimulation Checker. EPFL, 2003. Available from. http://lamp.epfl.ch/~sbriais/abc/abc.html
7. Fu Y. On Quasi-Open Bisimulation. Theoretical Computer Science 338 (2005) 96-126
8. Sangiorgi D. A Theory of Bisimulation for the π-calculus. Acta Informatica 33 (1996) 69-97
9. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715
10. Sangiorgi D., and Walker D. The π-calculus: a Theory of Mobile Processes (2001), Cambridge University Press
11. Sangiorgi D., and Walker D. Some results on barbed equivalences in pi-calculus. Proc. CONCUR '01. LNCS volume 2154 (2001), Springer Verlag
12. B. Victor. A Verification Tool for the Polyadic π-Calculus. Licentiate thesis, Department of Computer Systems, Uppsala University, Sweden, May © 1994. Available as report DoCS 94/50