De Nicola, Rocco and Vaandrager, Frits W. Three Logics for Branching Bisimulation. J. ACM, 42 (2). pp. 458-487. ISSN 0004-5411 (1995)Full text not available from this repository.
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.
|Additional Information:||ACM id: 201032|
|Uncontrolled Keywords:||CTL*, Hennessy-Milner logic, Kripke structures, backward modalities, branching bisimulation equivalence, concurrency, doubly labeled transition systems, labeled transition systems, reactive systems, semantics, stuttering equivalence, until operations|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 13:03|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)