Weak Kripke Structures and LTL
From MaRDI portal
Publication:3090846
DOI10.1007/978-3-642-23217-6_28zbMath1343.68155OpenAlexW129930684MaRDI QIDQ3090846
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_28
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 (4)
Program Repair for Hyperproperties ⋮ Unnamed Item ⋮ Model-Checking Counting Temporal Logics on Flat Structures ⋮ Taming past LTL and flat counter systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combining test case generation and runtime verification
- Mu-calculus path checking
- The complexity of propositional linear temporal logics in simple cases
- The stuttering principle revisited
- A parametric analysis of the state-explosion problem in model checking
- The Complexity of Poor Man's Logic
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- LTL Path Checking Is Efficiently Parallelizable
- The complexity of propositional linear temporal logics
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
- Logical definability and query languages over ranked and unranked trees
- CONCUR 2004 - Concurrency Theory
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Weak Kripke Structures and LTL