On MITL and Alternating Timed Automata over Infinite Words

DOI10.1007/978-3-319-10512-3_6zbMath1448.68291arXiv1406.4395OpenAlexW45450336MaRDI QIDQ5500555

Gilles Geeraerts, Morgane Estiévenart, Thomas Brihaye

Publication date: 6 August 2015

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

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

Mathematics Subject Classification ID

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

Related Items (4)

An SMT-based approach to satisfiability checking of MITL ⋮ The compound interest in relaxing punctuality ⋮ A logical characterization of timed regular languages ⋮ Unnamed Item

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