On the origins of bisimulation and coinduction

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 4, 2009, Pages

  Sangiorgi, Davide ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Bisimulation; Coinduction; Fixed points; Greatest fixed points; History

Indexed keywords

BISIMILARITY; BISIMULATION; BISIMULATIONS; COINDUCTION; FIXED POINT THEOREMS; FIXED POINT THEORY; FIXED POINTS; GREATEST FIXED POINTS; MODAL LOGIC;

PHILOSOPHICAL ASPECTS; SET THEORY;

COMPUTER SCIENCE;

EID: 69149096212     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1516507.1516510     Document Type: Article

References (137)

1. Aceto, L., Ingulfsduttir, A., Larsen, K. G., and Srba, J. 2007. Reactive Systems: Modelling, Specification and Verification. Cambridge University Press.
2. Aczel, P. 1988. Non-Well-Founded Sets. CSLI lecture notes, no. 14.
3. Aczel, P. 1993. Final universes of processes. In Proceedings of the Mathematical Foundations of Programming Semantcs (MFPS'93), B. et al., Ed. Lecture Notes in Computer Science, vol. 802. Springer, 1-28.
4. Alvarez, C., Balczar, J. L., Gabarrá, J., and Santha, M. 1991. Parallel complexity in the design and analysis on conurrent systems. In Proceedings of the Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms (PARLE'91). Lecture Notes in Computer Science, vol. 505. Springer, 288-303.
5. Amadio, R. M. and Cardelli, L. 1993. Subtyping recursive types. ACM Trans. Program. Lang. Syst. 15, 4, 575-631. A preliminary version appeared in POPL '91 (pp. 104-118), and as DEC Systems Research Center Res. rep. number 62, August 1990.
6. Arden, D. N. 1960. Delayed logic and finite state machines. In Theory of Computing Machine Design. University of Michigan Press, 1-35.
7. Bakker, J. W. D. 1971. Recursive Procedures. Mathematical Centre Tracts 24, Mathematisch Centrum, Amsterdam.
8. Bakker, J. W. D. 1975. The fixed-point approach in semantics: Theory and applications. In Foundations of Computer Science, J. de Bakker, Ed. Mathematical Centre Tracts 63, Mathematisch Centrum, Amsterdam, 3-53.
9. Bakker, J. W. D. and Roever, W. P. D. 1973. A calculus for recursive program schemes. In Proceedings of the IRIA Symposium on on Automata, Languages and Programming 1972, M. Nivat, Ed. North-Holland, 167-196.
10. Balczar, J. L., Gabarrá, J., and Santha, M. 1992. Deciding bisimilarity is P-complete. Formal Asp. Comput. 4, 6A, 638-648.
11. Barwise, J. and Etchemendy, J. 1987. The Liar: An Essay in Truth and Circularity. Oxford University Press.
12. Barwise, J., Gandy, R. O., and Moschovakis, Y. N. 1971. The next admissible set. J. Symb. Log. 36, 108-120.
13. Barwise, J. and Moss, L. 1996. Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI (Center for the Study of Language and Information).
14. Beki, H. 1969. Definable operations in general algebras and the theory of automata and flowcharts. Unpublished manuscript, IBM Lab. Vienna 1969. Also appeared in Jones {1984}.
15. Benthem, J. V. 1976. Modal correspondence theory. Ph.D. thesis, Mathematish Instituut and Instituut voor Grondslagenonderzoek, University of Amsterdam.
16. Benthem, J. V. 1983. Modal Logic and Classical Logic. Bibliopolis.
17. Benthem, J. V. 1984. Correspondence theory. In Handbook of Philosophical Logic, D. Gabbay and F. Guenthner, Eds. Vol. 2. Reidel 167-247.
18. Bernays, P. 1954. A system of axiomatic set theory-Part VII. J. Symb. Log. 19, 2, 81-96.
19. Birkhoff, G. 1948. Lattice Theory (revised edition). Vol. 25 of American Mathematical Society Colloquium Publications. American Mathematical Society.
20. Blackburn, P., Rijke, M. D., and Venema, Y. 2001. Modal Logic. Cambridge University
21. Press.
22. Blikle, A. 1977. A comparative review of some program verification methods. In 6th Symposium on Mathematical Foundations of Computer Science (MFCS'77), J. Gruska, Ed. Lecture Notes in Computer Science, vol. 53. Springer, 17-33.
23. Boffa, M. 1968. Les ensembles extraordinaires. Bull. Societe Math. Belgique XX, 3-15.
24. Boffa, M. 1969. Sur la theorie des ensembles sans axiome de fondement. Bull. Societe Math. Belgique XXXI, 16-56.
25. Boffa, M. 1972. Forcing et negation de l'axiome de fondement. Academie Royale de Belgique, Memoires de la classe des sciences, 2e serie XL, 7, 1-53.
26. Bourbaki, N. 1950. Sur le theorme de Zorn. Arch. Math.. 2, 434-437.
27. Brand, D. June 1978. Algebraic simulation between parallel programs. Res. rep. RC 7206, Yorktown Heights, New Yok, 39 pp.
28. Brandt, M. and Henglein, F. 1997. Coinductive axiomatization of recursive type equality and subtyping. In Proceedings of the 3rd Conference on Typed Lambda Calculi and Applications (TLCA'97), R. Hindley, Ed. Lecture Notes in Computer Science, vol. 1210. Springer, 63-81.
29. Burge, W. H. 1975. Stream processing functions. IBM J. Res. Development 19, 1, 12-25.
30. Cadiou, J. M. 1972. Recursive definitions of partial functions and their computations. Ph.D. thesis, Computer Science Department, Stanford University.
31. Clarke, E. M. 1977. Program invariants as fixed points (preliminary reports). In FOCS. IEEE, 18-29. Final version in Computing, 21, 4, 273-294, 1979. Based on Clarke's PhD thesis, Completeness and Incompleteness Theorems for Hoare-like Axiom Systems, Cornell University, 1976.
32. Coquand, T. 1993. Infinite objects in type theory. In TYPES, H. Barendregt and T. Nipkow, Eds. Lecture Notes in Computer Science, vol. 806. Springer, 62-78.
33. Cousot, P. and Cousot, R. 1979. Constructive versions of Tarski's fixed point theorems. Pacific J. Math. 81, 1, 43-57.
34. de Roever, W. P. 1977. On backtracking and greatest fixpoints. In 4th Colloquium on Automata, Languages and Programming (ICALP), A. Salomaa and M. Steinby, Eds. Lecture Notes in Computer Science, vol. 52. Springer, 412-429.
35. Devide, V. 1963. On monotonous mappings of complete lattices. Fundam. Math. LIII, 147-154.
36. Ehrenfeucht, A. 1961. An application of games to the completeness problem for formalized theories. Fundam. Math. 49, 129-141.
37. Finsler, P. 1926. uber die Grundlagen der Mengenlehre. I. Math. Zeitschrift 25, 683-713.
38. Floyd, R. W. 1967. Assigning meaning to programs. In Proceedings of the Symposia in Applied Mathematics. Vol. 19. American Mathematical Society, 19-32.
39. Forti, M. and Honsell, F. 1983. Set theory with free construction principles. Annali Scuola Normale Superiore, Pisa, Serie IV X, 3, 493-522.
40. Fraenkel, A. 1922. Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre. Math. Annalen 86, 230-237.
41. Fraïsse, R. 1953. Sur quelques classifications des systes de relations. Ph.D. thesis, University of Paris. Also in Publications Scientifiques de l'Universite d'Alger, series A 1, 35-182, 1954.
42. Friedman, H. 1973. The consistency of classical set theory relative to a set theory with intuitionistic logic. J. Symb. Log. 38, 315-319.
43. Giarratana, V. Gimona, F. and Montanari, U. 1976. Observability concepts in abstract data type specification. In 5th Symposium on Mathematical Foundations of Computer Science, A. Mazurkievicz, Ed. Lecture Notes in Computer Science, vol. 45. Springer, 576-587.
44. Gimenez, E. 1996. Un calcul de constructions infinies et son application a la verification des systemes communicants. Ph.D. thesis, Laboratoire de l'Informatique du Parallelisme, Ecole Normale Superieure de Lyon.
45. Ginsburg, S. and Rice, H. G. 1962. Two families of languages related to algol. J. ACM 9, 3, 350-371.
46. Ginzburg, A. 1968. Algebraic Theory of Automata. Academic Press.
47. Glabbeek, R. V. 1990. The linear time-branching time spectrum (extended abstract). In First Conference on Concurrency Theory (CONCUR'90), J. C. M. Baeten and J. W. Klop, Eds. Lecture Notes in Computer Science, vol. 458. Springer, 278-297.
48. Glabbeek, R. V. 1993. The linear time Branching time spectrum II (the semantics of sequential systems with silent moves). In 4th Conference on Concurrency Theory (CONCUR'93), E. Best, Ed. Lecture Notes in Computer Science, vol. 715, 66-81.
49. Goldblatt, R. 1989. Varieties of complex algebras. Ann. Pure Applied Logic 44, 173-242.
50. Gordeev, L. 1982. Constructive models for set theory with extensionality. In The L.E.J. Brouwer Centenary Symposium, A. Troelstra and D. van Dalen, Eds. 123-147.
51. Gourlay, J. S., Rounds, W. C., and Statman, R. 1979. On properties preserved by contraction of concurrent systems. In International Symposium on Semantics of Concurrent Computation, G. Kahn, Ed. Lecture Notes in Computer Science, vol. 70. Springer, 51-65.
52. Heijenoort (Ed.), J. V. 1967. From Frege to Gdel: A Source Book in Mathematical Logic 1879-1931. Harvard University Press.
53. Hennessy, M. and Milner, R. 1980. On observing nondeterminism and concurrency. In Proceedings of the 7th Colloquium Automata, Languages and Programming, J. W. de Bakker and J. van Leeuwen, Eds. Lecture Notes in Computer Science, vol. 85. Springer, 299-309.
54. Hennessy, M. and Milner, R. 1985. Algebraic laws for nondeterminism and concurrency. J. ACM 32, 137-161.
55. Hinnion, R. 1980. Contraction de structures et application à NFU. Comptes Rendus Acad. des Sciences de Paris 290, Ser. A, 677-680.
56. Hinnion, R. 1981. Extensional quotients of structures and applications to the study of the axiom of extensionality. Bull. Societe Math. Belgique XXXIII (Fas. II, Ser. B), 173-206.
57. Hinnion, R. 1986. Extensionality in Zermelo-Fraenkel set theory. Zeitschr. Math. Logik und Grundlagen Math. 32, 51-60.
58. Hitchcock, P. and Park, D. 1973. Induction rules and termination proofs. In Proceedings of the IRIA symposium on on Automata, Languages and Programming 1972, M. Nivat, Ed. North-Holland, 225-251.
59. Hoare, T. 1972. Proof of correctness of data representations. Acta Inf. 1, 271-281.
60. Honsell, F. 1981. Modelli della teoria degli insiemi, principi di regolarità e di libera costruzione. Tesi di Laurea, Universita' di Pisa.
61. Huffman, D. 1954. The synthesis of sequential switching circuits. J. Franklin Institute 257, 3-4, 161-190 and 275-303.
62. Immerman, N. 1982. Upper and lower bounds for first order expressibility. J. Comput. Syst. Sci. 25, 1, 76-98.
63. Jacobs, B. and Rutten, J. 1996. A tutorial on (co)algebras and (co)induction. Bull. EATCS 62, 222-259.
64. Jensen, K. 1980. A method to compare the descriptive power of different types of petri nets. In Proceedings of the 9th Mathematical Foundations of Computer Science (MFCS'80), P. Dembinski, Ed. Lecture Notes in Computer Science, vol. 88. Springer, 348-361.
65. Jones, C. B., Ed. 1984. Programming Languages and Their Definition - Hans Bekic (1936-1982). Lecture Notes in Computer Science, vol. 177. Springer.
66. Jongh, D. D. and Troelstra, A. 1966. On the connection of partially ordered sets with some pseudo-boolean algebras. Indagationes Math. 28, 317-329.
67. Kahn, G. 1974. The semantics of simple language for parallel programming. In IFIP Congress. North-Holland, 471-475.
68. Kanellakis, P. C. and Smolka, S. A. 1990. CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86, 1, 43-68.
69. Kantorovich, L. V. 1939. The method of successive approximations for functional equations. Acta Math. 71, 63-97.
70. Kleene, S. C. 1952. Introduction to Metamathematics. Van Nostrand.
71. Kleene, S. C. 1970. The origin of recursive function theory. In 20th Annual Symposium on Foundations of Computer Science. IEEE, 371-382.
72. Knaster, B. 1928. Un theorm sur les fonctions d'ensembles. Annals Soc. Pol. Math 6, 133-134.
73. Kwong, Y. S. 1977. On reduction of asynchronous systems. Theor. Comput. Sci. 5, 1, 25-50.
74. Landin, P. 1969. A program-machine symmetric automata theory. Mach. Intell. 5, 99-120.
75. Landin, P. J. 1964. The mechanical evaluation of expressions. The Comput. J. 6, 4, 308-320.
76. Landin, P. J. 1965a. Correspondence between ALGOL 60 and Church's Lambda-notation: Part I. Commun. ACM 8, 2, 89-101.
77. Landin, P. J. 1965b. A correspondence between ALGOL 60 and Church's Lambda-notations: Part II. Commun. ACM 8, 3, 158-167.
78. Lassez, J.-L., Nguyen, V. L., and Sonenberg, L. 1982. Fixed point theorems and semantics: A folk tale. Inf. Process. Lett. 14, 3, 112-116.
79. Manna, Z. 1969. The correctness of programs. J. Comput. Syst. Sci. 3, 2, 119-127.
80. Manna, Z. 1974. Mathematical Theory of Computation. McGraw-Hill.
81. Mazurkiewicz, A. 1973. Proving properties of processes. Tech. rep. 134, Computation Center ol Polish Academy of Sciences, Warsaw. Also in Algorytmy 11, 5-22, 1974.
82. Mazurkiewicz, A. W. 1971. Proving algorithms by tail functions. Inf. Control 18, 3, 220-226.
83. McCarthy, J. 1961. A basis for a mathematical theory of computation. In Proceedings of the Western Joint Computer Conference, Vol. 19. Spartan Books, 225-238. Reprinted, with corrections and an added tenth section, in Computer Programming and Formal Systems, P. Braffort and D. Hirschberg, eds., North-Holland, 1963, pp. 33-70.
84. McCarthy, J. 1963. Towards a mathematical science of computation. In Proceedings of the IFIP Congress 62. North-Holland, 21-28.
85. Meyer, A. R. and Stockmeyer, L. J. 1972. The equivalence problem for regular expressions with squaring requires exponential space. In 13th Annual Symposium on Switching and Automata Theory (FOCS). IEEE, 125-129.
86. Milner, R. 1970. A formal notion of simulation between programs. Memo 14, Computers and Logic Resarch Group, University College of Swansea, U.K.
87. Milner, R. 1971b. Program simulation: An extended formal notion. Memo 17, Computers and Logic Resarch Group, University College of Swansea, U.K.
88. Milner, R. 1980. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer.
89. Milner, R. 1989. Communication and Concurrency. Prentice Hall.
90. Milner, R. London, 1971a. An algebraic definition of simulation between programs. In Proceedings of the 2nd International Joint Conferences on Artificial Intelligence. British Computer Society.
91. Milner, R. and Tofte, M. 1991. Co-Induction in relational semantics. Theor. Comput. Sci. 87, 209-220. Also Tech. rep. ECS-LFCS-88-65, University of Edinburgh, 1988.
92. Mirimanoff, D. 1917a. Les antinomies de Russell et de Burali-Forti et le problme fondamental de la theorie des ensembles. L'Enseignement Math. 19, 37-52.
93. Mirimanoff, D. 1917b. Remarques sur la theorie des ensembles et les antinomies cantoriennes I. L'Enseignement Math. 19, 209-217.
94. Mirimanoff, D. 1920. Remarques sur la theorie des ensembles et les antinomies cantoriennes II. L'Enseignement Math. 21, 29-52.
95. Moore, E. 1956. Gedanken experiments on sequential machines. Automata Studies, Ann. Math. Series 34, 129-153.
96. Morris, J. H. Dec. 1968. Lambda-Calculus models of programming languages. Ph.D. thesis, M.I.T., project MAC.
97. Moschovakis, Y. N. 1974. Elementary Induction on Abstract Structures. Studies in Logic and the Foundations of Mathematics, vol. 77. North-Holland, Amsterdam.
98. Nerode, A. 1958. Linear automaton transformations. In Proceedings of the American Mathematical Society. Vol. 9. 541-544.
99. Paige, R. and Tarjan, R. E. 1987. Three partition refinement algorithms. SIAM J. Comput. 16, 6, 973-989.
100. Park, D. 1969. Fixpoint induction and proofs of program properties. In Machine Intelligence 5, B. Meltzer and D. Michie, Eds. Edinburgh University Press, 59-78.
101. Park, D. 1970. The Y-combinator in Scott's lambda-calculus models. Symposium on Theory of Programming, unpublished (A revised version: Res. rep. CS-RR-013, Department of Computer Science, University of Warwick, June 1976.).
102. Park, D. 1979. On the semantics of fair parallelism. In Proceedings of the Confernce on Abstract Software Specifications, Copenhagen Winter School. Lecture Notes in Computer Science. Springer, 504-526.
103. Park, D. 1981a. Concurrency on automata and infinite sequences. In Conference on Theoretical Computer Science, P. Deussen, Ed. Lecture Notes in Computer Science, vol. 104. Springer, 167-183.
104. Park, D. 1981b. A new equivalence notion for communicating systems. In Bull. EATCS, G. Maurer, Ed. Vol. 14. 78-80. Abstract of the talk presented at the 2nd Workshop on the Semantics of Programming Languages. Abstracts collected in the Bulletin by B. Mayoh.
105. Pasini, A. 1974. Some fixed point theorems of the mappings of partially ordered sets. Rendiconti del Seminario Matematico della Università di Padova 51, 167-177.
106. Pous, D. 2007. Complete lattices and up-to techniques. In 5th Asian Symposium on Programming Languages and Systems (APLAS). Lecture Notes in Computer Science, vol. 4807. Springer, 351-366.
107. Reynolds, J. C. 1993. The discoveries of continuations. Lisp Symbol. Comput. 6, 3-4, 233-248.
108. Rogers, H. 1967. Theory of Recursive Functions and Effective Computability. McGraw Hill. Reprinted, MIT Press 1987.
109. Russell, B. 1903. Principles of Mathematics. Cambridge University Press.
110. Russell, B. 1908. Mathematical logic as based on the theory of types. Amer. J. Math. 30, 222-262.
111. Russell, B. and Whitehead, A. N. 1910, 1912, 1913. Principia Mathematica, 3 vols. Cambridge University Press.
112. Rutten, J. and Turi, D. 1992. On the foundation of final semantics: Non-Standard sets, metric spaces, partial orders. In REX Workshop, J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds. Lecture Notes in Computer Science, vol. 666. Springer, 477-530.
113. Sangiorgi, D. 1998. On the bisimulation proof method. J. Math. Structures Comput. Sci. 8, 447-479.
114. Sangiorgi, D., Kobayashi, N., and Sumii, E. 2007. Environmental bisimulations for higher-order languages. In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS'07). IEEE Computer Society, 293-302.
115. Sangiorgi, D. and Walker, D. 2001. The π-Calculus: A Theory of Mobile Processes. Cambridge University Press.
116. Scott, D. 1960. A different kind of model for set theory. Unpublished paper, given at the 1960 Stanford Congress of Logic, Methodology and Philosophy of Science.
117. Scott, D. 1972a. Continuous lattices. In Toposes, Algebraic Geometry and Logic,
118. E. Lawvere, Ed. Lecture Notes in Mathematics, vol. 274. Springer, 97-136.
119. Scott, D. 1972b. The lattice of flow diagrams. In Symposium of Semantics of Algorithmic Languages, E. Engeler, Ed. Lecture Notes in Mathematics, vol. 188. Springer, 311-366.
120. Scott, D. 1976. Data types as lattices. SIAM J. Comput. 5, 522-587.
121. Scott, D. December 1969b. Models for the -calculus. Manuscript, raft, Oxford.
122. Scott, D. November 1969a. A construction of a model for the -calculus. Manuscript, Oxford.
123. Scott, D. October 1969c. A type-theoretical alternative to CUCH, ISWIM, OWHY. Typed script, Oxford. Also appeared as Scott {1993}.
124. Scott, D. and de Bakker, J. 1969. A theory of programs. Handwritten notes. IBM Lab., Vienna, Austria.
125. Scott, D. S. 1993. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theor. Comput. Sci. 121, 1-2, 411-440.
126. Segerberg, K. 1968. Decidability of S4.1. Theoria 34, 7-20.
127. Segerberg, K. 1970. Modal logics with linear alternative relations. Theoria 36, 301-322.
128. Segerberg, K. 1971. An essay in classical modal logic. Filosofiska Studier, Uppsala.
129. Skolem, T. 1923. Einige Bemerkungen zur Axiomatischen Begrundung der Mengenlehre. In Proceedings of the 5th Scandinavian Mathematics Congress, 1922. Akademiska Bokhandeln, Helsinki, 217-232. English translation, Some remarks on axiomatized set theory, in Heijenoort (Ed.) {1967}, pages 290-301.
130. Specker, E. 1957. Zur axiomatik der Mengenlehre. Z. Math. Logik 3, 3, 173-210.
131. Tarski, A. 1949. A fixpoint theorem for lattices and its applications (preliminary report). Bull. Amer. Math. Soc. 55, 1051-1052 and 1192.
132. Tarski, A. 1955. A lattice-theoretical fixpoint theorem and its applications.
133. Pac. J. Math. 5, 285-309.
134. Thomas, W. 1993. On the Ehrenfeucht-Fraïsse game in theoretical computer science. In TAPSOFT, M.-C. Gaudel and J.-P. Jouannaud, Eds. Lecture Notes in Computer Science, vol. 668. Springer, 559-568.
135. Thomason, S. K. 1972. Semantic analysis of tense logics. J. Symb. Log. 37, 1, 150-158.
136. Turi, D. and Plotkin, G. D. 1997. Towards a mathematical operational semantics. In 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97). IEEE Computer Society Press, 280-291.
137. Zermelo, E. 1908. Untersuchungen uber die Grundlagen der Mengenlehre I. Mathematische Annalen 65, 261-281. English translation, Investigations in the foundations of set theory, in Heijenoort (Ed.) {1967}, 199-215.