Open bisimulation, revisited

Theoretical Computer Science

Volumn 386, Issue 3, 2007, Pages 236-271

  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 SCIENCE; COMPUTER SIMULATION; CONCURRENT ENGINEERING;

IMPLEMENTABILITY; OPEN BISIMULATION;

DIFFERENTIATION (CALCULUS);

EID: 34848864969     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.010     Document Type: Article

References (27)

1. Sangiorgi D. A theory of bisimulation for the π-calculus. Acta Informatica 33 (1996) 69-97
2. Milner R., Parrow J., and Walker D. A calculus of mobile processes, part I/II. Information and Computation 100 (1992) 1-77
3. Parrow J. An introduction to the π-calculus. In: Bergstra J., Ponse A., and Smolka S. (Eds). Handbook of Process Algebra (2001), Elsevier B.V. 479-543
4. Sangiorgi D., and Walker D. The π-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
5. B. Victor, A verification tool for the polyadic π-calculus, Licentiate Thesis, Department of Computer Systems, Uppsala University, Sweden, available as report DoCS 94/50 (May 1994). URL http://www.docs.uu.se/~victor/tr/docs-tr-94-50.html
6. S. Briais, ABC Bisimulation Checker, EPFL (2003). URL http://lamp.epfl.ch/~sbriais/abc/abc.html
7. Abadi M., and Gordon A.D. A calculus for cryptographic protocols: The Spi calculus. Information and Computation 148 1 (1999) 1-70
8. Barendregt H. The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics vol. 103 (1984), North-Holland
9. Honda K., and Yoshida N. On reduction-based process semantics. Theoretical Computer Science 152 2 (1995) 437-486
10. Hennessy M., and Rathke J. Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14 5 (2004) 651-684
11. Hennessy M., and Lin H. Symbolic bisimulations. Theoretical Computer Science 138 2 (1995) 353-389
12. H. Lin, Symbolic bisimulation and proof systems for the π-calculus, Tech. Rep. 7/94, University of Sussex, Brighton, 1994
13. Boreale M., and De Nicola R. A symbolic semantics for the π-calculus. Information and Computation 126 1 (1996) 34-52
14. Borgström J., and Nestmann U. On bisimulations for the spi calculus. Mathematical Structures in Computer Science 15 (2005) 487-552
15. 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: Concurrency Theory. LNCS vol. 3170 (2004), Springer 161-176
16. Briais S., and Nestmann U. Open bisimulation, revisited. In: Baeten J., and Phillips I. (Eds). Proceedings of EXPRESS 2005: Expressiveness in Concurrency. ENTCS vol. 154 (2005), Elsevier B.V. 93-105
17. Sangiorgi D., and Walker D. On barbed equivalences in π-calculus. Proceedings of CONCUR '01: Concurrency Theory. LNCS vol. 2154 (2001), Springer 292-304
18. Fu Y. On quasi-open bisimulation. Theoretical Computer Science 338 (2005) 96-126
19. S. Briais, Formal proofs about hedges using the Coq proof assistant (2004). URL http://lamp.epfl.ch/~sbriais/spi/hedges/hedge.html
20. Abadi M., and Gordon A.D. A bisimulation method for cryptographic protocols. Nordic Journal of Computing 5 4 (1998) 267-303. http://www.cs.helsinki.fi/njc/References/abadig1998:267.html URL
21. Briais S., and Nestmann U. A formal semantics for protocol narrations. In: de Nicola R., and Sangiorgi D. (Eds). Trustworthy Global Computing. LNCS vol. 3705 (2005), Springer 163-181
22. S. Briais, Towards open bisimulation in the spi calculus, Mémoire de D.E.A., Université Paris VII - Denis Diderot (2002). URL http://lamp.epfl.ch/~sbriais/ENS/ps/rapport-DEA.ps.gz
23. Hüttel H. Deciding framed bisimilarity. In: Kučera A., and Mayr R. (Eds). Proceedings of INFINITY 2002. ENTCS vol. 68 (2002), Elsevier B.V. 20
24. Tiu A., and Miller D. A proof search specification of the π-calculus. 3rd Workshop on the Foundations of Global Ubiquitous Computing. ENTCS vol. 138 (2004) 79-101
25. Tiu A. Model checking for π-calculus using proof search. In: Abadi M., and de Alfaro L. (Eds). Proceedings of CONCUR 2005: Concurrency Theory. LNCS vol. 3653 (2005), Springer 36-50
26. Ziegler A., Miller D., and Palamidessi C. A congruence format for name-passing calculi. Proceedings of SOS 2005: Structural Operational Semantics. ENTCS vol. 156 (2005), Elsevier B.V., Lisbon, Portugal 169-189
27. Boreale M., and Gorla D. On compositional reasoning in the spi-calculus. In: Nielsen M., and Engberg U.H. (Eds). Proceedings of FoSSaCS 2002. LNCS vol. 2303 (2002), Springer 67-81