From MITL to Timed Automata

DOI10.1007/11867340_20zbMath1141.68436OpenAlexW1667231716MaRDI QIDQ3511242

Dejan Ničković, Oded Maler, Amir Pnueli

Publication date: 8 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11867340_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (18)

Metric temporal logic revisited ⋮ A brief account of runtime verification ⋮ Bounded variability of metric temporal logic ⋮ MR4UM: a framework for adding fault tolerance to UML state diagrams ⋮ Real-time policy enforcement with metric first-order temporal logic ⋮ An SMT-based approach to satisfiability checking of MITL ⋮ Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions ⋮ On the timed temporal logic planning of coupled multi-agent systems ⋮ MTL with Bounded Variability: Decidability and Complexity ⋮ Runtime enforcement of timed properties revisited ⋮ Robust control for signal temporal logic specifications using discrete average space robustness ⋮ The compound interest in relaxing punctuality ⋮ Checking Temporal Properties of Discrete, Timed and Continuous Behaviors ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Algebraic quantitative semantics for efficient online temporal monitoring ⋮ Unnamed Item ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic

This page was built for publication: From MITL to Timed Automata