Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Hirshfeld, A. Rabinovich (2004)
Logics for Real Time: Decidability and ComplexityFundam. Informaticae, 62
M. Bersani, Carlo Furia, Matteo Pradella, M. Rossi (2009)
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms2009 Seventh IEEE International Conference on Software Engineering and Formal Methods
M. Bersani, M. Rossi, P. Pietro (2015)
An SMT-based approach to satisfiability checking of MITLInf. Comput., 245
M. Abadi, L. Lamport (1991)
An old-fashioned recipe for real time
G. Kant, A. Laarman, J. Meijer, J. Pol, S. Blom, T. Dijk (2015)
LTSmin: High-Performance Language-Independent Model Checking
D. D'Souza, P. Prabhakar (2007)
On the expressiveness of MTL in the pointwise and continuous semanticsInternational Journal on Software Tools for Technology Transfer, 9
R. Kindermann, Tommi Junttila, I. Niemelä (2013)
Bounded Model Checking of an MITL Fragment for Timed Automata2013 13th International Conference on Application of Concurrency to System Design
Thomas Brihaye, G. Geeraerts, Hsi-Ming Ho, B. Monmege (2017)
MightyL: A Compositional Translation from MITL to Timed Automata
P. M. Merlin
[nA Study of the Recoverability of Computing Systems. PhD thesis.
M. Bersani, M. Rossi, P. Pietro (2013)
Deciding the Satisfiability of MITL Specifications
F. Marconi, M. Bersani, Madalina Erascu, M. Rossi (2016)
Towards the Formal Verification of Data-Intensive Applications Through Metric Temporal Logic
Uppaal
[nUppaal Web Page. Retrieved from http://www.uppaal.org/.
R. Alur, D. Dill (1994)
A Theory of Timed AutomataTheor. Comput. Sci., 126
Carlo Furia, D. Mandrioli, A. Morzenti, M. Rossi (2012)
Modeling Time in Computing
O. Maler, D. Ničković, A. Pnueli (2006)
From MITL to Timed Automata
K. Larsen, P. Pettersson, W. Yi (1997)
Uppaal in a nutshellInternational Journal on Software Tools for Technology Transfer, 1
P. Merlin (1974)
A study of the recoverability of computing systems.
Thomas Brihaye, G. Geeraerts, Hsi-Ming Ho, Arthur Milchior, B. Monmege (2018)
Efficient Algorithms and Tools for MITL Model-Checking and Synthesis2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS)
Joël Ouaknine, J. Worrell (2008)
Some Recent Results in Metric Temporal Logic
Marcello M. Bersani, Carlo A. Furia, Matteo Pradella, Matteo Rossi (2009)
Integrated modeling and verification of real-time systems through multiple paradigmsProceedings of the Conference on Software Engineering and Formal Methods (SEFM’09). IEEE
M. Bersani, M. Rossi, P. Pietro (2017)
A logical characterization of timed regular languagesTheor. Comput. Sci., 658
R. Jain (1994)
FDDI Handbook: High-Speed Networking Using Fiber and Other Media
D. Lime, O. Roux, Charlotte Seidner, Louis-Marie Traonouez (2009)
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
R. Alur, T. Feder, T. Henzinger (1991)
The benefits of relaxing punctuality
S. Yovine (1997)
KRONOS: a verification tool for real-time systemsInternational Journal on Software Tools for Technology Transfer, 1
A. Carioni, S. Ghilardi, Silvio Ranise (2012)
MCMT in the Land of Parametrized Timed Automata
Thomas Brihaye, G. Geeraerts, Hsi-Ming Ho, B. Monmege (2017)
Timed-Automata-Based Verification of MITL over Signals
Farn Wang (2001)
Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram
P. Bouyer, Fabrice Chevalier, N. Markey (2005)
On the Expressiveness of TPTL and MTLInf. Comput., 208
IEEE. [n
IEEE Web PageRetrieved from http://www.ieee802.org/3.
L. Moura, Nikolaj Bjørner (2008)
Z3: An Efficient SMT Solver
L. Baresi, Mohammad Kallehbasti, M. Rossi (2016)
How bit-vector logic can help improve the verification of LTL specifications over infinite domainsProceedings of the 31st Annual ACM Symposium on Applied Computing
M. Bersani, M. Rossi, P. Pietro (2013)
A tool for deciding the satisfiability of continuous-time metric temporal logicActa Informatica, 53
Z. Dang (2001)
Pushdown timed automata: a binary reachability characterization and safety verificationArXiv, cs.LO/0110010
Stephane Demri, D. D'Souza (2002)
An automata-theoretic approach to constraint LTL
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 article 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.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 10, 2020
Keywords: Model checking
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.