Timed-Automata-Based Verification of MITL over Signals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Timed-Automata-Based Verification of MITL over Signals

Résumé

It has been argued that the most suitable semantic model for real-time formalisms is the non-negative real line (signals), i.e. the continuous semantics, which naturally captures the continuous evolution of system states. Existing tools like Uppaal are, however, based on ω-sequences with timestamps (timed words), i.e. the pointwise semantics. Furthermore, the support for logic formalisms is very limited in these tools. In this article, we amend these issues by a compositional translation from Metric Temporal Interval Logic (MITL) to signal automata. Combined with an emptiness-preserving encoding of signal automata into timed automata, we obtain a practical automata-based approach to MITL model-checking over signals. We implement the translation in our tool MightyL and report on case studies using LTSmin as the back-end.
Fichier principal
Vignette du fichier
main.pdf (706.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01526986 , version 1 (23-05-2017)

Identifiants

Citer

Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege. Timed-Automata-Based Verification of MITL over Signals. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, France. pp.7:1--7:19, ⟨10.4230/LIPIcs.TIME.2017.7⟩. ⟨hal-01526986⟩
370 Consultations
179 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More