MTL with Bounded Variability: Decidability and Complexity
From MaRDI portal
Publication:3543293
Recommendations
Cites work
- scientific article; zbMATH DE number 747023 (Why is no real title available?)
- scientific article; zbMATH DE number 2112984 (Why is no real title available?)
- From MITL to Timed Automata
- Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling
- MTL with Bounded Variability: Decidability and Complexity
- On the decidability and complexity of Metric Temporal Logic over finite words
- Quantitative temporal logics over the reals: PSpace and below
- Real-time logics: Complexity and expressiveness
- Temporal logics with incommensurable distances are undecidable
- The benefits of relaxing punctuality
- Timed regular expressions
Cited in
(10)- From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
- MSO logics for weighted timed automata
- The compound interest in relaxing punctuality
- Metric temporal reasoning with less than two clocks
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Time-Bounded Verification
- On the Expressiveness of MTL Variants over Dense Time
- MTL with Bounded Variability: Decidability and Complexity
- Metric temporal logic revisited
- Bounded variability of metric temporal logic
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)