MightyL: A Compositional Translation from MITL to Timed Automata

Abstract

International audienceMetric 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

On the timed temporal logic planning of coupled multi-agent systems

“…We provide here an example that explains the notation that has been introduced until now. (14,28,2), l j1 = (28,14), l j2 = (2, 14),…”

“…In other words, an accepting run of a given TBA can be synthesized, if one exists. Any MITL formula ϕ over AP can be algorithmically translated into a TBA with the alphabet 2 AP , such that the language of timed words that satisfy ϕ is the language of timed words produced by the TBA ( [22,[26][27][28]).…”

Efficient Algorithms and Tools for MITL Model-Checking and Synthesis

“…Such a technique can already be found (for the continuous semantics) in the seminal paper of Alur et al [2], and several other proposals have been made since then [4], [16], including from some of the authors of the present paper. We will now discuss our recently introduced tool MightyL [6], which translates efficiently MITL formulae into equivalent timed automata 1 . To the best of our knowledge, MightyL is the first such tool that is freely available, although several translation algorithms have been proposed in the literature during the past 20 years.…”

“…During the past decade, we have been working to extend the theory about MITL (we have, for instance, characterised the decidability of synthesis, and proposed new translation techniques to timed automata), and to develop tools based on these new results. The cornerstone of our contribution is our recently introduced tool MightyL, which performs efficient translation of MITL into timed automata [6], [7], thereby enabling efficient automata-based modelchecking of MITL (thanks to efficient model-checking engines such as Uppaal [15] or LTSMin [13] with Opaal plugin as back-ends). We plan to continue this line of research by extending MightyL to perform efficient synthesis of MITL, based on the techniques presented in [11] for LTL.…”

Revisiting timed logics with automata modalities

“…For this reason, research e orts have been focused on fragments of MTL with decidable satis ability, most notably Metric Interval Temporal Logic (MITL), the fragment of MTL in which 'punctual' constraining intervals are not allowed [3]. In particular, MITL formulae can be e ectively translated into timed automata (TAs) [2], giving practical EXPSPACE decision procedures for its satis ability and model-checking problems [16][17][18].…”