Model Checking CTL is Almost Always Inherently Sequential
نویسندگان
چکیده
منابع مشابه
Model Checking Ctl Is
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator...
متن کاملModel Checking CTL+ and FCTL is Hard
Among the branching-time temporal logics used for the specification and verification of systems, CTL, FCTL and ECTL are the most notable logics for which the precise computational complexity of model checking is not known. We answer this longstanding open problem and show that model checking these (and some related) logics is ∆ p 2-complete.
متن کاملModel-checking Inherently Fair Linear-time Properties
The concept of linear-time verification with an inherent fairness condition has been studied under the names approximate satisfaction, satisfaction up to liveness, and satisfaction within fairness in several publications. Even though proving the general applicability of the approach, reasonably efficient algorithms for inherently fair linear-time verification (IFLTV) are lacking. This paper bri...
متن کاملModel Checking Games for CTL
We define model checking games for the temporal logic CTL∗ and prove their correctness. They provide a technique for using model checking interactively in a verification/specification process. Their main feature is to construct paths in a transition system stepwise. That enables them to be the basis for a local model checking algorithm with a natural notion of justification. However, this requi...
متن کاملFirst-Order-CTL Model Checking
This work presents a first-order model checking procedure that verifies systems with potentially infinite data spaces with respect to first-order CTL specification. The procedure relies on a partition of the system variables into control and data. While control values are expanded into BDD-representations, data values enter in form of their properties relevant to the verification task. The algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:12)2011