On the bisimulation proof method

Mathematical Structures in Computer Science

Volumn 8, Issue 5, 1998, Pages 447-479

  Sangiorgi, Davide ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000958908     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129598002527     Document Type: Article

References (30)

1. Abramsky, S. (1989) The Lazy Lambda Calculus. In: Turner, D. (ed) Research Topics in Functional Programming, Addison-Wesley 65–116.
2. Abramsky, S. (1991) A Domain Equation for Bisimulation. Information and Computation 92 161–218.
3. Aczel, P. (1988) Non-well-founded Sets, CSLI lecture notes 14.
4. Bergstra, J. and Klop, J. (1984) Process Algebra for Synchronous Communication. Information and Computation 60 109–137.
5. Bloom, B., Istrail, S. and Meyer, A. (1995) Bisimulation can't be Traced. Journal of the ACM 42(1) 232–268. Boreale, M. and De Nicola, R. (1995) Testing Equivalence for Mobile Processes. Information and Computation 120 279–303.
6. Boreale, M. and Sangiorgi, D. (1995) A fully abstract semantics for causality in the 7r-calculus. In: Mayr, E. and Puech, C. (eds) Proc. 12th Symposium on Theoretical Aspects of Computer Science (STACS’95). Springer Verlag Lecture Notes in Computer Science 900. (To appear in Acta Informatica.)
7. Caucal, D. (1990) Graphes Canoniques de Graphes Algebriques. Informatique Theorique et Applications (RAIRO) 24(4) 339–352.
8. Christensen, S., Hiittel, H. and Stirling, C. (1995) Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121(2).
9. De Simone, R. (1985) Higher Level Synchronising Devices in MEIJE-SCCS. Theoretical Computer Science 37 245–267.
10. Ferrari, G., Montanari, U. and Quaglia, P. (1996) A 7i-calculus with Explicit Substitutions. Theo-retical Computer Science 168(1) 53–103.
11. Fiore, M. (1993) A Coinduction principle for Recursive Data Types Based on Bisimulation. In: Proc. 8th LICS Conf, IEEE Computer Society Press.
12. Groote, J. (1990) Transition System Specifications with Negative Premises. In: Baeten, J. and Klop, J. (eds) Proc. CONCUR ’90. Springer Verlag Lecture Notes in Computer Science 458 332–341.
13. Groote, J. and Vaandrager F. (1992) Structured Operational Semantics and Bisimulation as a Congruence. Information and Computation 100 202–260.
14. Hennessy, M. and Milner, R. (1985) Algebraic Laws for Nondeterminism and Concurrency. Journal of the ACM 32 137–161.
15. Hirshfeld, Y., Jerrum, M. and Moller, F. (1996) A polynomial-time algorithm for deciding bisimu-lation equivalence of normed context-free processes. Theoretical Computer Science 158 143–159.
16. Joyal, A., Nielsen, M. and Winskel, G. (1994) Bisimulation from Open Maps. Tech. rept. RS-94-7. BRICS. (Extract in Proc. LICS’93, IEEE Computer Society Press.)
17. Larsen, K. and Liu, X. (1991) Compositionality through an Operational Semantics of Contexts. J. Logic Computat. 1(6) 761–795.
18. Milner, R. (1989) Communication and Concurrency, Prentice Hall.
19. Milner, R. (1991) The polyadic 7i-calculus: a tutorial. Tech. rept. ECS-LFCS-91-180. LFCS, Dept, of Comp. Sci., Edinburgh Univ. (Also in: Bauer, F. L., Brauer, W. and Schwichtenberg, H. (eds.) Logic and Algebra of Specification, Springer Verlag, 1993.)
20. Milner, R. and Tofte, M. (1991) Co-induction in relational semantics. Theoretical Computer Science 87 209–220.
21. Milner, R., Parrow, J. and Walker, D. (1992) A Calculus of Mobile Processes (Parts I and II). Information and Computation 100 1–77.
22. Parrow, J. and Sangiorgi, D. (1995) Algebraic Theories for Name-Passing Calculi. Information and Computation 120(2) 174–197.
23. Pitts, A. (1994) A Co-induction Principle for Recursively Defined Domains. Theoretical Computer Science 124 195–219.
24. Plotkin, G. (1981) WA Structural Approach to Operational Semantics. DAIMI-FN-19. Computer Science Department, Aarhus University.
25. Rutten, J. and Turi, D. (1994) Initial Algebra and Final Coalgebra Semantics for Concurrency. In: Proc. Rex School/Symposium 1993 A Decade of Concurrency - Reflexions and Perspectives’. Springer Verlag Lecture Notes in Computer Science 803.
26. Sangiorgi, D. (1992) Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh. Sangiorgi, D. (1995) Lazy functions and mobile processes. Tech. rept. RR-2515. INRIA-Sophia Antipolis. (To appear in ‘Festschrift volume in honor of Robin Milner’s 60th birthday’, MIT Press.)
27. Sangiorgi, D. (1996) Locality and Non-interleaving Semantics in Calculi for Mobile Processes. Theoretical Computer Science 155 39–83.
28. Sangiorgi, D. and Milner, R. (1992) The problem of ‘Weak Bisimulation up to’. In: Cleveland, W. (ed) Proc. CONCUR’92. Springer Verlag Lecture Notes in Computer Science 630 32–46.
29. Thomsen, B. (1990) Calculi for Higher Order Communicating Systems, Ph.D. thesis, Department of Computing, Imperial College.
30. Walker, D. (1994) Algebraic Proofs of Properties of Objects. Proc. ESOP’94. Springer Verlag Lecture Notes in Computer Science 788 501–516.