The complexity of counting models of linear-time temporal logic

DOI10.1007/s00236-016-0284-zzbMath1390.68441OpenAlexW2964114371MaRDI QIDQ1745344

Hazem Torfah, Martín G. Zimmermann

Publication date: 17 April 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4846/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items

From LTL to rLTL monitoring: improved monitorability through robust semantics

Uses Software

• Acacia+
• Unbeast

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Symbolic model checking: \(10^{20}\) states and beyond
• Safety, liveness and fairness in temporal logic
• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• Processing succinct matrices and vectors
• The Complexity of Counting Models of Linear-time Temporal Logic
• Unbeast: Symbolic Bounded Synthesis
• Polynomial Space Counting Problems
• Bounded Synthesis
• LTL Path Checking Is Efficiently Parallelizable
• The complexity of propositional linear temporal logics
• Computational Complexity
• Counting Models of Linear-Time Temporal Logic