Thumbnail
Access Restriction
Subscribed

Author De Nicola, Rocco ♦ Vaandrager, Frits
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1995
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword 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
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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1995-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 42
Issue Number 2
Page Count 30
Starting Page 458
Ending Page 487


Open content in new tab

   Open content in new tab
Source: ACM Digital Library