On MITL and Alternating Timed Automata

DOI10.1007/978-3-642-40229-6_4zbMath1390.68376arXiv1304.2814OpenAlexW2153485994MaRDI QIDQ2842659

Thomas Brihaye, Gilles Geeraerts, Morgane Estiévenart

Publication date: 16 August 2013

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

Full work available at URL: https://arxiv.org/abs/1304.2814

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

An SMT-based approach to satisfiability checking of MITL ⋮ The compound interest in relaxing punctuality

This page was built for publication: On MITL and Alternating Timed Automata