MTL with Bounded Variability: Decidability and Complexity

DOI10.1007/978-3-540-85778-5_9zbMath1171.03312OpenAlexW190073680MaRDI QIDQ3543293

Carlo A. Furia, Matteo Rossi

Publication date: 2 December 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (6)

Metric temporal logic revisited ⋮ Metric temporal reasoning with less than two clocks ⋮ Bounded variability of metric temporal logic ⋮ MTL with Bounded Variability: Decidability and Complexity ⋮ MSO logics for weighted timed automata ⋮ The compound interest in relaxing punctuality

Cites Work

• Unnamed Item
• Unnamed Item
• Real-time logics: Complexity and expressiveness
• Quantitative temporal logics over the reals: PSpace and below
• Temporal logics with incommensurable distances are undecidable
• Timed regular expressions
• Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling
• From MITL to Timed Automata
• MTL with Bounded Variability: Decidability and Complexity
• The benefits of relaxing punctuality
• On the decidability and complexity of Metric Temporal Logic over finite words

This page was built for publication: MTL with Bounded Variability: Decidability and Complexity