Back and Forth Bisimulations

This paper is concerned with bisimulation relations which do not only require related agents to simulate each others behavior in the direction of the arrows, but also to simulate each other when going back in history. First it is demonstrated that the back and forth variant of strong bisimulation leads to the same equivalence as the ordinary notion of strong bisimulation. Then it is shown that the back and forth variant of Milner's observation equivalence is different from (and finer than) observation equivalence. In fact we prove that it coincides with the branching bisimulation equivalence of Van Glabbeek & Weijland. Also the back and forth variants of branching, η and delay bisimulation lead to branching bisimulation equivalence. The notion of back and forth bisimulation moreover leads to characterizations of branching bisimulation in terms of abstraction homomorphisms and in terms of Hennessy-Milner logic with backward modalities. In our view these results support the claim that branching bisimulation is a natural and important notion.

[1]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[2]  Jos C. M. Baeten,et al.  Another Look at Abstraction in Process Algebra (Extended Abstract) , 1987, ICALP.

[3]  Ilaria Castellani Bisimulations and Abstraction Homomorphisms , 1987, J. Comput. Syst. Sci..

[4]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[7]  Ugo Montanari,et al.  Canonical Representatives for Observational Equivalence Classes , 1989 .

[8]  Rocco De Nicola,et al.  Three Logics for Branching Bisimulation (Extended Abstract) , 1990, LICS 1990.

[9]  Joseph Sifakis,et al.  Property Preserving Homomorphisms of Transition Systems , 1983, Logic of Programs.

[10]  Jos C. M. Baeten,et al.  Another look at abstraction in process algebra , 1987 .

[11]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[12]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[13]  Ugo Montanari,et al.  Labeled Event Structures: A Model for Observable Concurrency , 1982, Formal Description of Programming Concepts.

[14]  Anne Dicky,et al.  An Algebraic Characterization of Transition System Equivalences , 1989, Inf. Comput..

[15]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[16]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[17]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[18]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[19]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[20]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1985, Inf. Control..

[21]  Rob J. van Glabbeek,et al.  Branching Time and Abstraction in Bisimulation Semantics (Extended Abstract) , 1989, IFIP Congress.