LTL Model Checking of Parametric Timed Automata

The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The proposed problem could be solved using an explicit enumeration of all possible parameter valuations. However, we introduce a symbolic zone-based method for synthesising bounded integer parameters of parametric timed automata with an LTL specification. Our method extends the ideas of the standard automata-based approach to LTL model checking of timed automata. Our solution employs constrained parametric difference bound matrices and a suitable notion of extrapolation.

[1]  Guangyuan Li.  Checking Timed Büchi Automata Emptiness Using LU-Abstractions , 2009, FORMATS.

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

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

[4]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

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

[6]  Ivana Cerná,et al.  On Clock-Aware LTL Properties of Timed Automata , 2014, ICTAC.

[7]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[8]  Didier Lime,et al.  Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games , 2013, ATVA.

[9]  F. Vaandrager,et al.  Linear Parametric Model Checking of Timed Automata , 2001 .

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

[11]  Stavros Tripakis,et al.  Checking Timed Büchi Automata Emptiness Efficiently , 2005, Formal Methods Syst. Des..

[12]  Stavros Tripakis,et al.  Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.

[13]  Wang Yi,et al.  UPPAAL - present and future , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

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