Verification of continuous dynamical systems by timed automata

This paper presents a method for abstracting continuous dynamical systems by timed automata. The abstraction is based on partitioning the state space of a dynamical system using positive invariant sets, which form cells that represent locations of a timed automaton. The abstraction is intended to enable formal verification of temporal properties of dynamical systems without simulating any system trajectory, which is currently not possible. Therefore, conditions for obtaining sound, complete, and refinable abstractions are set up.The novelty of the method is the partitioning of the state space, which is generated utilizing sub-level sets of Lyapunov functions, as they are positive invariant sets. It is shown that this partition generates sound and complete abstractions. Furthermore, the complete abstractions can be composed of multiple timed automata, allowing parallelization of the verification process. The proposed abstraction is applied to two examples, which illustrate how sound and complete abstractions are generated and the type of specification we can check. Finally, an example shows how the compositionality of the abstraction can be used to analyze a high-dimensional system.

[1]  Symbolic dynamics , 2008, Scholarpedia.

[2]  Manfred Morari,et al.  Proceedings of the 8th international conference on Hybrid Systems: computation and control , 2005 .

[3]  B. Dundas,et al.  DIFFERENTIAL TOPOLOGY , 2002 .

[4]  Kim G. Larsen,et al.  A Tutorial on Uppaal , 2004, SFM.

[5]  Michel Verhaegen,et al.  Proceedings of the 37th IEEE Conference on Decision and Control , 1998 .

[6]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[7]  C. Tomlin,et al.  Symbolic reachable set computation of piecewise affine hybrid automata and its application to biological modelling: Delta-Notch protein signalling. , 2004, Systems biology.

[8]  Oded Maler,et al.  Recent progress in continuous and hybrid reachability analysis , 2006, 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control.

[9]  Athanasios C. Antoulas,et al.  Approximation of Large-Scale Dynamical Systems (Advances in Design and Control) (Advances in Design and Control) , 2005 .

[10]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and an Introduction to Chaos , 2003 .

[11]  G. E. Bredon.  Topology and geometry , 1993 .

[12]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[13]  Joseph Sifakis,et al.  Tools and Applications II: The IF Toolset , 2004 .

[14]  A. Kurzhanski,et al.  Ellipsoidal Calculus for Estimation and Control , 1996 .

[15]  Kim G. Larsen,et al.  Verification, Performance Analysis and Controller Synthesis for Real-Time Systems , 2009, FSEN.

[16]  R. Wiśniewski.  Flow Lines Under Perturbation within Section Cones , 2005 .

[17]  Paulo Tabuada,et al.  Approximately Bisimilar Symbolic Models for Incrementally Stable Switched Systems , 2008, IEEE Transactions on Automatic Control.

[18]  George J. Pappas,et al.  Geometric programming relaxations for linear system reachability , 2004, Proceedings of the 2004 American Control Conference.

[19]  Athanasios C. Antoulas,et al.  Approximation of Large-Scale Dynamical Systems , 2005, Advances in Design and Control.

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

[21]  Rafael Wisniewski,et al.  Abstraction of continuous dynamical systems utilizing Lyapunov functions , 2010, 49th IEEE Conference on Decision and Control (CDC).

[22]  Ashish Tiwari,et al.  Abstractions for hybrid systems , 2008, Formal Methods Syst. Des..

[23]  M. Peixoto,et al.  Structural stability on two-dimensional manifolds☆ , 1962 .

[24]  J. Palis,et al.  Geometric theory of dynamical systems : an introduction , 1984 .

[25]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

[26]  Jasmin Fisher.  Proceedings of the 1st international workshop on Formal Methods in Systems Biology , 2008 .

[27]  Vincent D. Blondel,et al.  Proceedings of the 2000 American Control Conference , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[28]  Loring W. Tu,et al.  An introduction to manifolds , 2007 .

[29]  Kim Guldstrand Larsen,et al.  Formal Methods for the Design of Real-Time Systems , 2004, Lecture Notes in Computer Science.

[30]  Janan Zaytoon,et al.  Safety verification and reachability analysis for hybrid systems , 2009, Annu. Rev. Control..

[31]  Antoine Girard,et al.  Reachability of Uncertain Linear Systems Using Zonotopes , 2005, HSCC.

[32]  K. Meyer.  ENERGY FUNCTIONS FOR MORSE SMALE SYSTEMS. , 1968 .

[33]  M. Broucke.  A geometric approach to bisimulation and verification of hybrid systems , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[34]  Rafael Wisniewski,et al.  Geometric analysis of nondeterminacy in dynamical systems , 2007, Acta Informatica.

[35]  Rajeev Alur,et al.  Progress on Reachability Analysis of Hybrid Systems Using Predicate Abstraction , 2003, HSCC.

[36]  Thomas A. Henzinger,et al.  Symbolic Algorithms for Infinite-State Games , 2001, CONCUR.

[37]  松本 幸夫.  An introduction to Morse theory , 2002 .

[38]  Oded Maler,et al.  Approximating Continuous Systems by Timed Automata , 2008, FMSB.

[39]  Yu. S. Ledyaev,et al.  Nonsmooth analysis and control theory , 1998 .

[40]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[41]  Amir Pnueli,et al.  Proceedings of the 6th international conference on Hybrid systems: computation and control , 2003 .