eprintid: 365
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/65
datestamp: 2011-06-13 13:03:19
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-13 13:03:19
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Vaandrager, Frits W.
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Three Logics for Branching Bisimulation
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
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
note: ACM id: 201032
abstract: 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.
date: 1995
date_type: published
publication: J. ACM
volume: 42
number: 2
publisher: ACM
pagerange: 458-487
id_number: 10.1145/201019.201032
refereed: TRUE
issn: 0004-5411
official_url: http://doi.acm.org/10.1145/201019.201032
citation:   De Nicola, Rocco and Vaandrager, Frits W.  Three Logics for Branching Bisimulation.  J. ACM, 42 (2).  pp. 458-487.  ISSN 0004-5411      (1995)