Formalized Timed Automata

Timed automata are a widely used formalism for modeling real-time systems, which is employed in a class of successful model checkers such as UPPAAL. These tools can be understood as trust-multipliers: we trust their correctness to deduce trust in the safety of systems checked by these tools. However, mistakes have previously been made. This particularly regards an approximation operation, which is used by model-checking algorithms to obtain a finite search space. The use of this operation left a soundness problem in the tools employing it, which was only discovered years after the first model checkers were devised. This work aims to provide certainty to our knowledge of the basic theory via formalization in Isabelle/HOL: we define the main concepts, formalize the classic decidability result for the language emptiness problem, prove correctness of the basic forward analysis operations, and finally outline how both streams of work can be combined to show that forward analysis with the common approximation operation correctly decides emptiness for the class of diagonal-free timed automata.

[1]  Patricia Bouyer,et al.  Are Timed Automata Updatable? , 2000, CAV.

[2]  Mamoun Filali,et al.  A Mechanized Semantic Framework for Real-Time Systems , 2013, FORMATS.

[3]  Thomas A. Henzinger,et al.  Parametric real-time reasoning , 1993, STOC.

[4]  Huaikou Miao,et al.  Manipulating Clocks in Timed Automata Using PVS , 2009, 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing.

[5]  Simon Wimmer,et al.  Timed Automata , 2016, Arch. Formal Proofs.

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  Wang Yi,et al.  Automatic verification of real-time communicating systems by constraint-solving , 1994, FORTE.

[8]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[9]  Stephan Merz,et al.  Model Checking , 2000 .

[10]  Huaikou Miao,et al.  Formal Verification Framework for Safety of Real-Time System based on Timed Automata Model in PVS , 2006, IASTED Conf. on Software Engineering.

[11]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[12]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[13]  David L. Dill,et al.  Timing Assumptions and Verification of Finite-State Concurrent Systems , 1989, Automatic Verification Methods for Finite State Systems.

[14]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[15]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[16]  P. Castéran,et al.  Towards a Generic Tool for Reasoning about Labeled Transition Systems , 2022 .

[17]  Christine Paulin-Mohring.  Modelisation of Timed Automata in Coq , 2001, TACS.

[18]  Patricia Bouyer,et al.  Forward Analysis of Updatable Timed Automata , 2004, Formal Methods Syst. Des..

[19]  Patricia Bouyer,et al.  Untameable Timed Automata! , 2003, STACS.