The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
From MaRDI portal
Publication:4982126
DOI10.1016/j.entcs.2009.02.041zbMath1347.68217MaRDI QIDQ4982126
Heribert Vollmer, Henning Schnoor, Thomas Schneider, Ilka Schnoor, Martin Mundhenk, Michael Bauland
Publication date: 23 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.041
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
03B44: Temporal logic
Related Items
On the applicability of Post's lattice, The complexity of satisfiability for fragments of hybrid logic. I., Generalized modal satisfiability, Weak Kripke Structures and LTL, The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I