De Nicola, Rocco and Montanari, Ugo and Vaandrager, Frits W. Back and Forth Bisimulations. In: CONCUR '90 Theories of Concurrency: Unification and Extension. Lecture Notes in Computer Science, 458 . Springer, pp. 152-165. ISBN 3-540-53048-7 (1990)Full text not available from this repository.
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, eegr 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.
|Item Type:||Book Section|
|Funders:||First and second authors where supported by ESPRIT project 3011 (CEDISYS)., The research of the third author was supported by RACE project no. 1046, Specification and Programming Environment for Communication Software (SPECS) and by ESPRIT project no. 3006 (CONCUR).|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||10 Jun 2011 12:33|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)