On the Expressiveness of MTL Variants over Dense Time
From MaRDI portal
Recommendations
- On the Expressiveness of MTL with Past Operators
- On the expressiveness of TPTL and MTL
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- MTL with Bounded Variability: Decidability and Complexity
- Temporal predicate transformers and fair termination
- Time robustness in MTL and expressivity in hybrid system falsification
Cited in
(11)- Sampling polynomial trajectories for LTL verification
- MITL verification under timing uncertainty
- On the expressiveness of TPTL and MTL
- Bounded variability of metric temporal logic
- Metric temporal logic revisited
- Metric temporal reasoning with less than two clocks
- Linear-time temporal logic with event freezing functions
- On the Expressiveness of MTL with Past Operators
- An infinitary variant of Metric Temporal Logic over dense time domains
- Heterogeneous and asynchronous networks of timed systems
- Robustness of temporal logic specifications for continuous-time signals
This page was built for publication: On the Expressiveness of MTL Variants over Dense Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510842)