Branching time and orthogonal bisimulation equivalence

Theoretical Computer Science

Volumn 309, Issue 1-3, 2003, Pages 313-355

  Bergstra, Jan A ^a,b   Ponse, Alban ^a   Van der Zwaag, Mark B ^c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

Branching time; Labelled transition system; Orthogonal bisimulation; Process algebra; Silent step

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; EQUIVALENCE CLASSES; MATHEMATICAL OPERATORS; SEMANTICS;

ORTHOGONAL BISIMULATION; PROCESS ALGEBRA;

COMPUTER SCIENCE;

EID: 0242440302     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00277-9     Document Type: Article

References (36)

1. Baeten J.C.M., Bergstra J.A., Klop J.W. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inform. IX:1986;127-168.
2. Baeten J.C.M., Bergstra J.A., Klop J.W. On the consistency of Koomen's fair abstraction rule. Theoret. Comput. Sci. 51(1/2):1987;129-176.
3. Baeten J.C.M., van Glabbeek R.J. Another look at abstraction in process algebra (extended abstract). Ottmann Th. Proc. 14th Internat. Colloq. on Automata, Languages and Programming (ICALP'87). Lecture Notes in Computer Science. Vol. 267:1987;84-94 Springer, Berlin.
4. J.C.M. Baeten, C. Verhoef, Concrete process algebra, in: S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 4, Oxford University Press, Oxford, 1995, pp. 149-268.
5. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, 1990.
6. Bergstra J.A., Bethke I., Ponse A. Process algebra with iteration and nesting. Comput. J. 37(4):1994;243-258.
7. Bergstra J.A., Fokkink W.J., Ponse A. Process algebra with recursive operations. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;333-389 Elsevier, Amsterdam.
8. Bergstra J.A., Klop J.W. Process algebra for synchronous communication. Inform. and Control. 60(1-3):1984;109-137.
9. Bergstra J.A., Klop J.W. Algebra of communicating processes with abstraction. Theoret. Comput. Sci. 37(1):1985;77-121.
10. Bergstra J.A., Ponse A. Non-regular iterators in process algebra. Theoret. Comput. Sci. 269(1-2):2001;203-229.
11. Bergstra J.A., Ponse A. Register-machine based processes. J. ACM. 48(6):2001;1207-1241.
12. Bol R.N., Groote J.F. The meaning of negative premises in transition system specifications. J. ACM. 43(5):1996;863-914.
13. Bradfield J.C., Sterling C. Modal logics and mu-calculi: an introduction. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;293-330 Elsevier, Amsterdam.
14. Cleaveland R., Lüttgen G., Natarjan V. Priority in process algebra. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;711-765 Elsevier, Amsterdam.
15. Fokkink W.J. Introduction to Process Algebra, Texts in Theoretical Computer Science. 2000;Springer, Berlin.
16. Fokkink W.J., Zantema H. Basic process algebra with iteration. completeness of its equational axioms Comput. J. 37(4):1994;259-267.
17. R.J. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Manuscript. Preliminary version available by ftp at ftp://boole.stanford.edu/-pub/-spectrum.ps.gz . Extended abstract in: E. Best (Ed.), CONCUR'93, 4th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 715, Springer, Berlin, 1993.
18. van Glabbeek R.J. A complete axiomatization for branching bisimulation congruence of finite-state behaviours. Borzyszkowski A.M., Sokolowski S. Proc. Mathematical Foundations of Computer Science 1993 (MFCS). Lecture Notes in Computer Science. Vol. 711:1993;473-484 Springer, Berlin.
19. R.J. van Glabbeek, What is branching time semantics and why to use it? Bull. EATCS 53 (1994), 190-198; M. Nielsen (Ed.), The Concurrency Column.
20. R.J. van Glabbeek, What is branching time semantics and why to use it? Bull. EATCS 53 (1994), 190-198; M. Nielsen (Ed.), The Concurrency Column.
21. van Glabbeek R.J. The linear time-branching time spectrum I; the semantics of concrete, sequential processes. Bergstra J.A., Ponse A., Smolka S.A. Handbook of Process Algebra. 2001;3-99 Elsevier, Amsterdam.
22. van Glabbeek R.J., Weijland W.P. Branching time and abstraction in bisimulation semantics (extended abstract). Ritter G.X. Information Processing 89, Proc. IFIP 11th World Computer Congress. 1989;613-618 North-Holland, Amsterdam. Full version in [22].
23. van Glabbeek R.J., Weijland W.P. Branching time and abstraction in bisimulation semantics. J. ACM. 43(3):1996;555-600.
24. Hennessy M., Milner R. Algebraic laws for nondeterminism and concurrency. J. ACM. 32:1985;137-161.
25. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science. Vol. 92:1980;Springer, Berlin.
26. Milner R. Modal characterisation of observable machine behaviour. Astesiano G., Bohm C. Proc. CAAP 81. Lecture Notes in Computer Science. Vol. 112:1981;25-34 Springer, Berlin.
27. Milner R. Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 28(3):1983;267-310.
28. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs.
29. Minsky M.L. Computation: Finite and Infinite Machines. 1967;Prentice-Hall, Englewood Cliffs N.J.
30. De Nicola R., Vaandrager F.W. Three logics for branching bisimulation. J. ACM. 42(2):1995;458-487.
31. Park D.M.R. Concurrency and automata on infinite sequences. Deussen P. 5th GI Conf. Lecture Notes in Computer Science. Vol. 104:1981;167-183 Springer, Berlin.
32. C. Sterling, Modal and temporal logics for processes, Logics for Concurrency, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 149-237.
33. Tanenbaum A.S. Computer Networks. 2nd Ed. 1989;Prentice-Hall, Englewood Cliffs, NJ.
34. Vaandrager F.W. Two simple protocols. Baeten J.C.M. Applications of Process Algebra. Cambridge Tracts in Theoretical Computer Science. Vol. 17:1990;23-45 Cambridge University Press, Cambridge.
35. M.B. van der Zwaag, Some verifications in process algebra with iota, Report P9806, Programming Research Group, University of Amsterdam, 1998.
36. van der Zwaag M.B. A verification in process algebra with iota. Groote J.F., Luttik S.P., van Wamel J.J. Proc. Third Internat. Workshop on Formal Methods for Industrial Critical Systems. 1998;347-368 CWI, Amsterdam, The Netherlands.