AN NP-COMPLETE FRAGMENT OF LTL
From MaRDI portal
Publication:5462673
DOI10.1142/S0129054105003261zbMath1161.03303OpenAlexW2070461765MaRDI QIDQ5462673
Anca Muscholl, Igor Walukiewicz
Publication date: 3 August 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054105003261
Analysis of algorithms and problem complexity (68Q25) 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 (3)
Temporal BI: proof system, semantics and translations ⋮ Embedding theorems for LTL and its variants ⋮ Bounded linear-time temporal logic: a proof-theoretic investigation
Cites Work
- Modalities for model checking: Branching time logic strikes back
- The complexity of propositional linear temporal logics in simple cases
- Past is for free: On the complexity of verifying linear temporal properties with past
- On the expressive power of temporal logic
- The complexity of propositional linear temporal logics
This page was built for publication: AN NP-COMPLETE FRAGMENT OF LTL
