A tableau construction for finite linear-time temporal logic
From MaRDI portal
Publication:2669249
DOI10.1016/j.jlamp.2021.100743OpenAlexW3216746143MaRDI QIDQ2669249
Publication date: 9 March 2022
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.09339
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking in dense real-time
- Results on the propositional \(\mu\)-calculus
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- An implementation of an efficient algorithm for bisimulation equivalence
- Finite-trace linear temporal logic: coinductive completeness
- Comparing LTL Semantics for Runtime Verification
- “Sometimes” and “not never” revisited
- Three Partition Refinement Algorithms
- Alternation
- Variants of LTL Query Checking
This page was built for publication: A tableau construction for finite linear-time temporal logic
