Bisimulation: From the origins to today

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 298-302

  Sangiorgi, Davide ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SET THEORY;

ALGEBRAIC STRUCTURES; BISIMULATION; HOMOMORPHISM; LABELLED TRANSITION SYSTEM (LTS);

COMPUTER PROGRAMMING LANGUAGES;

EID: 4544265652     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319624     Document Type: Conference Paper

References (36)

1. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. In C. Hankin, editor, Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, volume 1381 of Lecture Notes in Computer Science, pages 12-26. Springer Verlag, 1998.
2. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, 10 Jan. 1999.
3. P. Aczel. Non-well-founded Sets. CSLI lecture notes; no. 14, 1988.
4. R. M. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993. A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Research Report number 62, August 1990.
5. R. M. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575-631, 1993. A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Research Report number 62, August 1990.
6. E. Astesiano, A. Giovini, and G. Reggio. Generalized bisimulation in relational specifications. In STACS '88, volume 294 of Lecture Notes in Computer Science, pages 207-226. Springer Verlag, 1988.
7. J. v. Benthem. Modal Correspondence Theory. PhD thesis, Mathematish Instituut & Instituut voor Grondslagenonderzoek, University of Amsterdam, 1976.
8. M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. In Proc. LICS'99, pages 157-166. IEEE, Computer Society Press, July 1999.
9. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In Proc. 13th LICS Conf. IEEE Computer Society Press, 1998.
10. M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. In R. Hindley, editor, Proc. 3d Int'l Conf. on Typed Lambda Calculi and Applications (TLCA), Nancy, France, April 2-4, 1997, volume 1210 of Lecture Notes in Computer Science (LNCS), pages 63-81. Springer-Verlag, Apr. 1997.
11. T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, Selected Papers from 1st Int. Wksh. on Types for Proofs and Programs, TYPES'93, Nijmegen, The Netherlands, 24-28 May 1993, volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer-Verlag, Berlin, 1994.
12. M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore, Pisa, Serie IV, X(3), 1983.
13. E. Giménez. Un Calcul de Constructions Infinies et son Application a la Verification des Systemes Communicants. PhD thesis PhD 96-11, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, Dec. 1996.
14. R. Hinnion. Contraction de structures et application à NFU. C. R. Acad. Se. Paris, 290, Sèr. A:677-680, 1980.
15. R. Hinnion. Extensional quotients of structures and applications to the study of the axiom of extensionality. Bull. Soc. Math. Belg., XXXIII, Fas. II, S/'er. B, 1981.
16. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
17. F. Honsell. Modelli della teoria degli insiemi, principi di regolarita' e di libera costruzione. Tesi di Laurea, Universita' di Pisa, 1981.
18. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
19. B. Jacobs and J. Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the EATCS, 62:222-259, 1996.
20. A. Jeffrey and J. Rathke. Contextual equivalence for higher-order pi-calculus revisited. In Proc. MFPS XIX, volume 83 of ENTCS. Elsevier Science Publishers, 2003.
21. D. d. Jongh and A. Troelstra. On the connection between partially ordered sets and some pseudo-boolean algebras. Indigationes Mathematicae, 28:317-329, 1966.
22. M. Merro and M. Hennessy. Bisimulation congruences in Safe Ambients. In Proc. 29th POPL. ACM Press, 2002.
23. R. Milner. A formal notion of simulation between programs. Memo 14, Computers and Logic Resarch Group, University College of Swansea, U.K., 1970.
24. R. Milner. An algebraic definition of simulation between programs. In Proc. 2nd Int. Conf. on Artificial Intelligence. British Comp. Soc. 1971.
25. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.
26. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
27. R. Milner. Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, 1999.
28. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. 19th ICALP, volume 623 of Lecture Notes in Computer Science, pages 685-695. Springer Verlag, 1992.
29. R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87:209-220, 1991.
30. D. Park. Concurrency on automata and infinite sequences. In P. Deussen, editor, Conf. on Theoretical Computer Science, volume 104 of Lecture Notes in Computer Science. Springer Verlag, 1981.
31. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Information and Computation, 131(2):141-178, 1996.
32. D. Sangiorgi. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science, 8:447-479, 1998.
33. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
34. K. Segerberg. An essay in Classical Modal Logic. Filosofiska Studier 13. University of Uppsala, 1971.
35. P. Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274:183-230, 2002.
36. B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990.