TY  - JOUR
N2  - Three 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.
TI  - Three Logics for Branching Bisimulation
A1  - De Nicola, Rocco
A1  - Vaandrager, Frits W.
PB  - ACM
IS  - 2
UR  - http://doi.acm.org/10.1145/201019.201032
AV  - none
SN  - 0004-5411
N1  - ACM id: 201032
Y1  - 1995///
ID  - eprints365
EP  - 487
SP  - 458
KW  - CTL*
KW  -  Hennessy-Milner logic
KW  -  Kripke structures
KW  -  backward modalities
KW  -  branching bisimulation equivalence
KW  -  concurrency
KW  -  doubly labeled transition systems
KW  -  labeled transition systems
KW  -  reactive systems
KW  -  semantics
KW  -  stuttering equivalence
KW  -  until operations
JF  - J. ACM
VL  - 42
ER  -