Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
From MaRDI portal
Recommendations
- Satisfiability for MTL and TPTL over non-monotonic data words
- MTL and TPTL for One-Counter Machines
- On the decidability and complexity of Metric Temporal Logic over finite words
- Some Recent Results in Metric Temporal Logic
- On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing
Cites work
- A really temporal logic
- An Expressive Temporal Logic for Real Time
- Complexity of metric temporal logics with counting and the Pnueli modalities
- Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
- Expressiveness of Metric Modalities for Continuous Time
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Logics meet 1-clock alternating timed automata
- Making Metric Temporal Logic Rational
- Mathematical Foundations of Computer Science 2003
- On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing
- On Process-Algebraic Extensions of Metric Temporal Logic
- On the Expressiveness of MTL with Past Operators
- Real-time logics: Complexity and expressiveness
- The benefits of relaxing punctuality
- The compound interest in relaxing punctuality
Cited in
(3)
This page was built for publication: Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488465)