Model Checking CTL is Almost Always Inherently Sequential

DOI10.2168/LMCS-7(2:12)2011zbMath1220.68068OpenAlexW2949521423WikidataQ57998315 ScholiaQ57998315MaRDI QIDQ3003330

No author found.

Publication date: 26 May 2011

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-7(2:12)2011

zbMATH Keywords

complexitymodel checkingtemporal logiccomputation tree logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Complexity of Model Checking for Modal Dependence Logic ⋮ A two-level approach based on model checking to support architecture conformance checking ⋮ On the applicability of Post's lattice ⋮ Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic ⋮ The model checking fingerprints of CTL operators