Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers

DOI10.1007/978-3-540-85762-4_9zbMath1161.68567OpenAlexW1581639155MaRDI QIDQ5505598

Carlo A. Furia, Paola Spoletini

Publication date: 27 January 2009

Published in: Theoretical Aspects of Computing - ICTAC 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85762-4_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (4)

Checking EMTLK properties of timed interpreted systems via bounded model checking ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Compositional reasoning using intervals and time reversal ⋮ Satisfiability checking for mission-time \textsf{LTL} (MLTL)

Cites Work

• Real-time logics: Complexity and expressiveness
• The complexity of propositional linear temporal logics in simple cases
• Model Checking Temporal Metric Specifications with Trio2Promela
• The complexity of propositional linear temporal logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers