MightyL: A Compositional Translation from MITL to Timed Automata

Thomas Brihaye (1) , Gilles Geeraerts (2) , Hsi-Ming Ho (1) , Benjamin Monmege (3)

1 UMons - Université de Mons
2 ULB - Université libre de Bruxelles
3 MOVE - Modélisation et Vérification

Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart of Linear Temporal Logic (LTL). Unfortunately, the tool support for MITL verification is still lacking to this day. In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata. Our construction subsumes the well-known construction from LTL to Büchi automata by Gastin and Oddoux and yet has the additional benefits of being compositional and integrating easily with existing tools. We implement the construction in our new tool MightyL and report on experiments using Uppaal and LTSmin as back-ends.

Domaines: Théorie et langage formel [cs.FL]; Informatique et langage [cs.CL]; Informatique et théorie des jeux [cs.GT]; Logique en informatique [cs.LO]

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege. MightyL: A Compositional Translation from MITL to Timed Automata. 29th International Conference on Computer Aided Verification (CAV'17), Jul 2017, Heidelberg, Germany. pp.421-440, ⟨10.1007/978-3-319-63387-9_21⟩. ⟨hal-01525524⟩