Three logics for branching bisimulation

Three temporal logics are introduced which induce on labeled transition systems the same identifications as branching bisimulation. The first is an extension of Hennessy-Milner logic with a kind of unit operator. The second is another extension of Hennessy-Milner logic which exploits the power of backward modalities. The third is CTL* with the next-time operator interpreted over all paths, not just over maximal ones. A relevant side effect of the last characterization is that it sets a bridge between the state- and event-based approaches to the semantics of concurrent systems.<<ETX>>

[1]  Paola Inverardi,et al.  Using the Axiomatic Presentation of Behavioural Equivalences for Manipulating CCS Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[2]  J.J.C. Meijer,et al.  Refinement in branching time semantics , 1989 .

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

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

[5]  Edmund M. Clarke,et al.  Compositional model checking , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[6]  Jai Srinivasan,et al.  Branching time temporal logic , 1988, REX Workshop.

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

[8]  Bengt Jonsson,et al.  Implementing a Model Checking Algorithm by Adapting Existing Automated Tools , 1989, Automatic Verification Methods for Finite State Systems.

[9]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[10]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

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

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

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

[14]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[15]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[16]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[17]  A. Meyer,et al.  Bisimulation can't be traced. Preliminary report , 1987 .