The compound interest in relaxing punctuality
From MaRDI portal
Publication:2024340
DOI10.1007/978-3-319-95582-7_9zbMath1460.68059OpenAlexW2809438112MaRDI QIDQ2024340
Publication date: 4 May 2021
Full work available at URL: https://doi.org/10.1007/978-3-319-95582-7_9
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Propositional dynamic logic of regular programs
- A theory of timed automata
- \textsc{MightyL}: a compositional translation from MITL to timed automata
- Metric Temporal Logic with Counting
- On MITL and Alternating Timed Automata
- Time-Bounded Verification
- Timed regular expressions
- Revisiting MITL to Fix Decision Procedures
- Expressiveness of Metric Modalities for Continuous Time
- From MITL to Timed Automata
- On the Merits of Temporal Testers
- MTL with Bounded Variability: Decidability and Complexity
- From Mtl to Deterministic Timed Automata
- From Philosophical to Industrial Logics
- The benefits of relaxing punctuality
- Making Metric Temporal Logic Rational
- On MITL and Alternating Timed Automata over Infinite Words
- Hybrid Systems: Computation and Control
- Foundations of Software Science and Computational Structures
- An Expressive Temporal Logic for Real Time
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Formal Modeling and Analysis of Timed Systems
- Foundations of Software Science and Computation Structures
This page was built for publication: The compound interest in relaxing punctuality
