Completeness of the bounded satisfiability problem for constraint LTL

DOI10.1007/978-3-642-24288-5_7zbMATH Open1347.03031OpenAlexW11196356MaRDI QIDQ3172864FDOQ3172864

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Temporal logic (03B44) Logic in computer science (03B70)

Cited In (6)

• HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.
• Constraint LTL satisfiability checking without automata
• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
• An SMT-based approach to satisfiability checking of MITL
• Fuzzy Time in Linear Temporal Logic
• A tool for deciding the satisfiability of continuous-time metric temporal logic

   Recommendations

• Constraint LTL satisfiability checking without automata 👍 👎
• The effects of bounding syntactic resources on Presburger LTL 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Verification, Model Checking, and Abstract Interpretation 👍 👎

This page was built for publication: Completeness of the bounded satisfiability problem for constraint LTL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172864)