Journal article
Model Checking MITL Formulae on Timed Automata
Abstract
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 …
Authors
Menghi C; Bersani MM; Rossi M; San Pietro P
Journal
ACM Transactions on Computational Logic, Vol. 21, No. 3, pp. 1–44
Publisher
Association for Computing Machinery (ACM)
Publication Date
July 31, 2020
DOI
10.1145/3383687
ISSN
1529-3785