Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP

We study the reduction of bounded reachability analysis of timed automata (TA) to a Mixed Integer Linear Programming (MILP) problem. While bounded model checking of timed automata has been explored in the literature based on the satisfiability of Boolean constraint formulas over linear arithmetic constraints verified using SAT Modulo Theory (SMT) solvers, the approach presented in this paper opens up the alternative of using MILP solvers. We present some preliminary results comparing the two approaches and provide ideas on how linear optimization can be useful for analyzing the behavior of TA. The results are supported by a prototype implementation which relies either on a MILP solver (Gurobi) or an SMT solver (MathSAT). Certain techniques for reducing the search space and improving the performance are also discussed.

[1]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[2]  Stephan Merz,et al.  Model Checking - Timed UML State Machines and Collaborations , 2002, FTRTFT.

[3]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[4]  Susanne Graf,et al.  OMEGA: correct development of real time and embedded systems , 2008, Software & Systems Modeling.

[5]  Wang Yi,et al.  Formal Verification of UML Statecharts with Real-Time Extensions , 2002, FASE.

[6]  Gilles Audemard,et al.  Bounded Model Checking for Timed Systems , 2002, FORTE.

[7]  Navendu Jain,et al.  Verification of Timed Automata via Satisfiability Checking , 2002, FTRTFT.

[8]  Iulian Ober,et al.  Timed Extensions for SDL , 2001, SDL Forum.

[9]  Wang Yi,et al.  Clock Difference Diagrams , 1998, Nord. J. Comput..

[10]  Joseph Sifakis,et al.  The IF Toolset , 2004, SFM.

[11]  Wang Yi,et al.  Partial Order Reductions for Timed Systems , 1998, CONCUR.

[12]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

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

[14]  Martin Fränzle,et al.  Efficient Proof Engines for Bounded Model Checking of Hybrid Systems , 2005, FMICS.

[15]  Peter Niebert,et al.  SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata , 2010, TACAS.

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

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

[18]  Farn Wang.  Efficient Verification of Timed Automata with BDD-Like Data-Structures , 2003, VMCAI.

[19]  Maria Sorea.  Bounded Model Checking for Timed Automata , 2002, Electron. Notes Theor. Comput. Sci..

[20]  Patricia Bouyer,et al.  Weighted Timed Automata: Model-Checking and Games , 2006, MFPS.

[21]  Wang Yi,et al.  Developing UPPAAL over 15 years , 2011, Softw. Pract. Exp..

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  S. Zennou,et al.  A partial order semantics approach to the clock explosion problem of timed automata , 2005, Theor. Comput. Sci..

[24]  Susanne Graf,et al.  Expression of Time and Duration Constraints in SDL , 2002, SAM.

[25]  Alessandro Cimatti,et al.  Model Checking of Hybrid Systems Using Shallow Synchronization , 2010, FMOODS/FORTE.