MTL with Bounded Variability: Decidability and Complexity
From MaRDI portal
Publication:3543293
DOI10.1007/978-3-540-85778-5_9zbMATH Open1171.03312OpenAlexW190073680MaRDI QIDQ3543293FDOQ3543293
Authors: 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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- From MITL to Timed Automata
- MTL with Bounded Variability: Decidability and Complexity
- Title not available (Why is that?)
- The benefits of relaxing punctuality
- Title not available (Why is that?)
- Real-time logics: Complexity and expressiveness
- On the decidability and complexity of Metric Temporal Logic over finite words
- Timed regular expressions
- Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling
- Quantitative temporal logics over the reals: PSpace and below
- Temporal logics with incommensurable distances are undecidable
Cited In (10)
- Metric temporal logic revisited
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- The compound interest in relaxing punctuality
- From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
- Time-Bounded Verification
- Metric temporal reasoning with less than two clocks
- On the Expressiveness of MTL Variants over Dense Time
- MTL with Bounded Variability: Decidability and Complexity
- Bounded variability of metric temporal logic
- MSO logics for weighted timed automata
This page was built for publication: MTL with Bounded Variability: Decidability and Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543293)
