Weak Kripke Structures and LTL

DOI10.1007/978-3-642-23217-6_28zbMath1343.68155MaRDI QIDQ3090846

Bernd Finkbeiner, Lars Kuhtz

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

Mathematics Subject Classification ID

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

Unnamed Item, Unnamed Item, Taming past LTL and flat counter systems, Program Repair for Hyperproperties

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