Completeness of the Bounded Satisfiability Problem for Constraint LTL
From MaRDI portal
Publication:3172864
DOI10.1007/978-3-642-24288-5_7zbMath1347.03031OpenAlexW11196356MaRDI QIDQ3172864
Matteo Rossi, Marcello M. Bersani, Achille Frigeri, Pierluigi San Pietro
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24288-5_7
Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44)
Related Items (4)
Fuzzy Time in Linear Temporal Logic ⋮ An SMT-based approach to satisfiability checking of MITL ⋮ Constraint LTL satisfiability checking without automata ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic
This page was built for publication: Completeness of the Bounded Satisfiability Problem for Constraint LTL
