van Glabbeek, Rob and Luttik, Bas and Trcka, Nikola - Computation Tree Logic with Deadlock Detection

lmcs:758 - Logical Methods in Computer Science, December 22, 2009, Volume 5, Issue 4
Computation Tree Logic with Deadlock Detection

Authors: van Glabbeek, Rob and Luttik, Bas and Trcka, Nikola

We study the equivalence relation on states of labelled transition systems of satisfying the same formulas in Computation Tree Logic without the next state modality (CTL-X). This relation is obtained by De Nicola & Vaandrager by translating labelled transition systems to Kripke structures, while lifting the totality restriction on the latter. They characterised it as divergence sensitive branching bisimulation equivalence. We find that this equivalence fails to be a congruence for interleaving parallel composition. The reason is that the proposed application of CTL-X to non-total Kripke structures lacks the expressiveness to cope with deadlock properties that are important in the context of parallel composition. We propose an extension of CTL-X, or an alternative treatment of non-totality, that fills this hiatus. The equivalence induced by our extension is characterised as branching bisimulation equivalence with explicit divergence, which is, moreover, shown to be the coarsest congruence contained in divergence sensitive branching bisimulation equivalence.


Source : oai:arXiv.org:0912.2109
DOI : 10.2168/LMCS-5(4:5)2009
Volume: Volume 5, Issue 4
Published on: December 22, 2009
Submitted on: June 25, 2015
Keywords: Computer Science - Logic in Computer Science,F.4.1,D.2.4


Share

Browsing statistics

This page has been seen 28 times.
This article's PDF has been downloaded 3 times.