Reference : Model Checking MITL formulae on Timed Automata: a Logic-Based Approach
Scientific journals : Article
Engineering, computing & technology : Computer science
Security, Reliability and Trust
Model Checking MITL formulae on Timed Automata: a Logic-Based Approach
Menghi, Claudio mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Bersani, Marcello [Politecnico di Milano]
Rossi, Matteo [Politecnico di Milano]
San Pietro, Pierluigi [Politecnico di Milano]
ACM Transactions on Computational Logic
Association for Computing Machinery (ACM)
Yes (verified by ORBilu)
New York, NY
United States
[en] Model Checking ; Timed Automaton ; Signal-Based Semantics
[en] Timed Automata (TA) is de facto a standard modelling formalism to represent systems when the interest is the analysis of their behaviour as time progresses. This modelling formalism is mostly used for checking whether the behaviours of a system satisfy a set of properties of interest. Even if efficient model-checkers for Timed Automata exist, these tools are not easily configurable. First, they are not designed to easily allow adding new Timed Automata constructs, such as new synchronization mechanisms or communication procedures, but they assume a fixed set of Timed Automata constructs. Second, they usually do not support the Metric Interval Temporal Logic (MITL) and rely on a precise semantics for the logic in which the property of interest is specified which cannot be easily modified and customized. Finally, they do not easily allow using different solvers that may speed up verification in different contexts.
This paper presents a novel technique to perform model checking of Metric Interval Temporal Logic (MITL) properties on TA. The technique relies on the translation of both the TA and the MITL formula into an intermediate Constraint LTL over clocks (CLTLoc) formula which is verified through an available decision procedure. The technique is flexible since the intermediate logic allows the encoding of new semantics as well as new TA constructs, by just adding new CLTLoc formulae. Furthermore, our technique is not bound to a specific solver as the intermediate CLTLoc formula can be verified using different procedures.
H2020 ; 694277 - TUNE - Testing the Untestable: Model Testing of Complex Software-Intensive Systems

File(s) associated to this reference

Fulltext file(s):

Open access
main.pdfAuthor postprint1.12 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.