Computation Tree Logic with Deadlock Detection
From MaRDI portal
Publication:3401140
DOI10.2168/LMCS-5(4:5)2009zbMath1200.68166MaRDI QIDQ3401140
Bas Luttik, Nikola Trčka, Robert J. van Glabbeek
Publication date: 28 January 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
temporal logictransition systembisimulation equivalencedeadlockparallel compositionstuttering equivalence
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (14)
An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation ⋮ Unnamed Item ⋮ All congruences below stability-preserving fair testing or CFFD ⋮ Off-the-shelf automated analysis of liveness properties for just paths ⋮ Reactive Turing machines ⋮ Cartesian difference categories ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence ⋮ Unnamed Item ⋮ A thesis for interaction ⋮ Divide and congruence III: Stability & divergence ⋮ Next-preserving branching bisimulation
This page was built for publication: Computation Tree Logic with Deadlock Detection
