IMT Institutional Repository: No conditions. Results ordered -Date Deposited. 2024-05-18T06:16:01ZEPrintshttp://eprints.imtlucca.it/images/logowhite.pnghttp://eprints.imtlucca.it/2011-06-16T07:49:09Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/378This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3782011-06-16T07:49:09ZThree Logics for Branching Bisimulation (Extended Abstract)Rocco De Nicolar.denicola@imtlucca.itFrits W. Vaandrager2011-06-13T13:03:19Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/365This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3652011-06-13T13:03:19ZThree Logics for Branching BisimulationThree temporal logics are introduced that induce on labeled transition systems the same identifications as branching bisimulation, a behavioral equivalence that aims at ignoring invisible transitions while preserving the branching structure of systems. The first logic is an extension of Hennessy-Milner Logic with an “until” operator. The second one is another extension of Hennessy-Milner Logic, which exploits the power of backward modalities. The third logic is CTL* without the next-time operator. A relevant side-effect of the last characterization is that it sets a bridge between the state- and action-based approaches to the semantics of concurrent systems.Rocco De Nicolar.denicola@imtlucca.itFrits W. Vaandrager2011-06-10T12:33:03Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/376This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3762011-06-10T12:33:03ZBack and Forth BisimulationsThis 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.Rocco De Nicolar.denicola@imtlucca.itUgo MontanariFrits W. Vaandrager2011-05-31T12:27:28Z2011-07-11T14:36:27Zhttp://eprints.imtlucca.it/id/eprint/379This item is in the repository with the URL: http://eprints.imtlucca.it/id/eprint/3792011-05-31T12:27:28ZAction versus State based Logics for Transition SystemsA temporal logic based on actions rather than on states is presented and interpreted over labelled transition systems. It is proved that it has essentially the same power as CTL*, a temporal logic interpreted over Kripke structures. The relationship between the two logics is established by introducing two mappings from Kripke structures to labelled transition systems and viceversa and two transformation functions between the two logics which preserve truth. A branching time version of the action based logic is also introduced. This new logic for transition systems can play an important role as an intermediate between Hennessy-Milner Logic and the modal μ-calculus. It is sufficiently expressive to describe safety and liveness properties but permits model checking in linear time.Rocco De Nicolar.denicola@imtlucca.itFrits W. Vaandrager