Branching time and orthogonal bisimulation equivalence

Baeten, 1986, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform., IX, 127 Baeten, 1987, On the consistency of Koomen's fair abstraction rule, Theoret. Comput. Sci., 51, 129, 10.1016/0304-3975(87)90052-1 Baeten, 1987, Another look at abstraction in process algebra (extended abstract), Vol. 267, 84 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. J.C.M. Baeten, W.P. Weijland, Process Algebra, Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, 1990. Bergstra, 1994, Process algebra with iteration and nesting, Comput. J., 37, 243, 10.1093/comjnl/37.4.243 Bergstra, 2001, Process algebra with recursive operations, 333 Bergstra, 1984, Process algebra for synchronous communication, Inform. and Control, 60, 109, 10.1016/S0019-9958(84)80025-X Bergstra, 1985, Algebra of communicating processes with abstraction, Theoret. Comput. Sci., 37, 77, 10.1016/0304-3975(85)90088-X Bergstra, 2001, Non-regular iterators in process algebra, Theoret. Comput. Sci., 269, 203, 10.1016/S0304-3975(00)00413-8 Bergstra, 2001, Register-machine based processes, J. ACM, 48, 1207, 10.1145/504794.504799 Bol, 1996, The meaning of negative premises in transition system specifications, J. ACM, 43, 863, 10.1145/234752.234756 Bradfield, 2001, Modal logics and mu-calculi: an introduction, 293 Cleaveland, 2001, Priority in process algebra, 711 Fokkink, 2000 Fokkink, 1994, Basic process algebra with iteration, Comput. J., 37, 259, 10.1093/comjnl/37.4.259 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. van Glabbeek, 1993, A complete axiomatization for branching bisimulation congruence of finite-state behaviours, Vol. 711, 473 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. van Glabbeek, 2001, The linear time–branching time spectrum I; the semantics of concrete, sequential processes, 3 van Glabbeek, 1989, Branching time and abstraction in bisimulation semantics (extended abstract), 613 van Glabbeek, 1996, Branching time and abstraction in bisimulation semantics, J. ACM, 43, 555, 10.1145/233551.233556 Hennessy, 1985, Algebraic laws for nondeterminism and concurrency, J. ACM, 32, 137, 10.1145/2455.2460 Milner, 1980, A Calculus of Communicating Systems, Vol. 92 Milner, 1981, Modal characterisation of observable machine behaviour, Vol. 112, 25 Milner, 1983, Calculi for synchrony and asynchrony, Theoret. Comput. Sci., 28, 267, 10.1016/0304-3975(83)90114-7 Milner, 1989 Minsky, 1967 De Nicola, 1995, Three logics for branching bisimulation, J. ACM, 42, 458, 10.1145/201019.201032 Park, 1981, Concurrency and automata on infinite sequences, Vol. 104, 167 C. Sterling, Modal and temporal logics for processes, Logics for Concurrency, Lecture Notes in Computer Science, Vol. 1043, Springer, Berlin, 1996, pp. 149–237. Tanenbaum, 1989 Vaandrager, 1990, Two simple protocols, Vol. 17, 23 M.B. van der Zwaag, Some verifications in process algebra with iota, Report P9806, Programming Research Group, University of Amsterdam, 1998. van der Zwaag, 1998, A verification in process algebra with iota, 347