Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past
From MaRDI portal
Publication:2842605
DOI10.1016/S1571-0661(05)80366-4zbMath1270.68172OpenAlexW2026209850MaRDI QIDQ2842605
Publication date: 15 August 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(05)80366-4
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of temporal logics with past
- Real-time logics: Complexity and expressiveness
- Completing the temporal picture
- Reasoning about infinite computations
- The complexity of propositional linear temporal logics in simple cases
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- The complexity of propositional linear temporal logics
This page was built for publication: Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past