Branching bisimilarity is an equivalence indeed!

Information Processing Letters

Volumn 58, Issue 3, 1996, Pages 141-147

  Basten, Twan ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Branching bisimilarity; Concurrency theory; Formal semantics

Indexed keywords

EID: 0000306444     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00034-8     Document Type: Article

References (12)

1. J.C.M. Baeten and W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science 18 (Cambridge University Press, Cambridge, UK, 1990).
2. B. Bloom, Structural operational semantics for weak bsimulations, Theoret. Comput. Sci. 146 (1995) 25-68.
3. F. Cherief and Ph. Schnoebelen, τ-bisimulations and full abstraction for refinement of actions, Inform. Process. Lett. 40 (4) (1990) 219-222.
4. Ph. Darondeau and P. Degano, About semantic action refinement, Fund. Inform. XIV (1991) 221-234.
5. R. De Nicola, U. Montanari and F.W. Vaandrager, Back and forth bisimulations, in: J.C.M. Baeten and J.W. Klop, eds., Proc. CONCUR '90. Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, Lecture Notes in Computer Science 458 (Springer, Berlin, 1990) 152-165.
6. R. De Nicola and F.W. Vaandrager, Three logics for branching bisimulation, J. ACM 42 (2) (1995) 458-487.
7. R.J. van Glabbeek, A complete axiomatization for branching bisimulation congruence of finite-state behaviours, in: A.M. Borzyszkowski and S. Sokolłowski, eds., Proc. 18th Internat. Symp. on Mathematical Foundations of Computer Science, Gdańsk, Poland, Lecture Notes in Computer Science 711 (Springer, Berlin, 1993) 473-484.
8. R.J. van Glabbeek, The linear time - Branching time spectrum II: The semantics of sequential systems with silent moves (extended abstract), in: E. Best, ed., Proc. 4th Internat. Conf. on Concurrency Theory, CONCUR '93, Hildesheim, Germany, Lecture Notes in Computer Science 715 (Springer, Berlin, 1993) 66-81.
9. R.J. van Glabbeek and W.P. Weijland, Branching time and abstraction in bisimulation semantics (extended abstract), in: G.X. Ritter, ed., Proc. 11th IFIP World Computer Congress, Information Processing 89, San Francisco, CA (North-Holland, Amsterdam, 1989) 613-618.
10. R.J. van Glabbeek and W.P. Weijland, Branching time and abstraction in bisimulation semantics, Rept. CS-R9120, Centre for Mathematics and Computer Science, CWI, Amsterdam, The Netherlands, 1991; a revised version with a corrected equivalence proof will appear in the J. ACM.
11. R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science 92 (Springer, Berlin, 1980).
12. W.P. Weijland, Synchrony and asynchrony in process algebra, Ph.D. Thesis, Dept. of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1989.