relation: http://eprints.imtlucca.it/376/
title: Back and Forth Bisimulations
creator: De Nicola, Rocco
creator: Montanari, Ugo
creator: Vaandrager, Frits W.
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: Springer
contributor: C. M. Baeten, Jos
contributor: Willem Klop, Jan
date: 1990
type: Book Section
type: PeerReviewed
identifier:   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)  
relation: http://dx.doi.org/10.1007/BFb0039058
relation: 10.1007/BFb0039058