Generating invariants for non-linear hybrid systems

We describe powerful computational techniques, relying on linear algebraic methods, for generating ideals of non-linear invariants of algebraic hybrid systems. We show that the preconditions for discrete transitions and the Lie-derivatives for continuous evolution can be viewed as morphisms, and so can be suitably represented by matrices. We reduce the non-trivial invariant generation problem to the computation of the associated eigenspaces or nullspaces by encoding the consecution requirements as specific morphisms represented by such matrices. Our methods are the first to establish very general sufficient conditions that show the existence and allow the computation of invariant ideals. Our approach also embodies a strategy to estimate certain degree bounds, leading to the discovery of rich classes of inductive invariants. By reducing the problem to related linear algebraic manipulations we are able to address various deficiencies of other state-of-the-art invariant generation methods, including the efficient treatment of non-linear hybrid systems. Our approach avoids first-order quantifier eliminations, Grobner basis computations or direct system resolutions, thereby circumventing difficulties met by other recent techniques. We handle non-linear hybrid systems extended with parameters.We extract the generator basis of a vector space of non-trivial invariants.The problem is reduced to the computation of associated eigenspaces or null spaces.Sufficient conditions for the existence and the computation of invariant ideals.

[1]  T. Henzinger,et al.  Algorithmic Analysis of Nonlinear Hybrid Systems , 1998, CAV.

[2]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[3]  Ashish Tiwari,et al.  Nonlinear Systems: Approximating Reach Sets , 2004, HSCC.

[4]  Arnaldo Vieira Moura,et al.  Endomorphisms for Non-trivial Non-linear Loop Invariant Generation , 2008, ICTAC.

[5]  Zohar Manna,et al.  Introduction to mathematical theory of computation , 1972 .

[6]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[7]  Carla Piazza,et al.  Algorithmic Algebraic Model Checking I: Challenges from Systems Biology , 2005, CAV.

[8]  Salvador Lucas,et al.  Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic , 2009, CADE.

[9]  Martin Kreuzer,et al.  Computational Commutative Algebra 1 , 2000 .

[10]  Andreas Bauer,et al.  Tool-support for the analysis of hybrid systems and models , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[11]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[12]  S. Shankar Sastry,et al.  Conflict resolution for air traffic management: a study in multiagent hybrid systems , 1998, IEEE Trans. Autom. Control..

[13]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[14]  Nacim Meslem,et al.  Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization , 2008, HSCC.

[15]  André Platzer,et al.  Logical Analysis of Hybrid Systems - Proving Theorems for Complex Dynamics , 2010 .

[16]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[17]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[18]  A. Moura,et al.  Endomorphism for Non-Trivial Semi-Algebraic Loop Invariant Generation , 2008 .

[19]  Thomas A. Henzinger,et al.  HYTECH: The Cornell HYbrid TECHnology Tool , 1994, Hybrid Systems.

[20]  Martin Fränzle,et al.  HySAT: An efficient proof engine for bounded model checking of hybrid systems , 2007, Formal Methods Syst. Des..

[21]  Edmund M. Clarke,et al.  Computing differential invariants of hybrid systems as fixedpoints , 2008, Formal Methods Syst. Des..

[22]  Arnaldo Vieira Moura,et al.  Transcendental inductive invariants generation for non-linear differential and hybrid systems , 2012, HSCC '12.

[23]  Henny B. Sipma,et al.  Constructing invariants for hybrid systems , 2008, Formal Methods Syst. Des..

[24]  Bruno Buchberger Symbolic Computation: Computer Algebra and Logic , 1996, FroCoS.

[25]  Sriram Sankaranarayanan,et al.  Automatic abstraction of non-linear systems using change of bases transformations , 2011, HSCC '11.

[26]  Sumit Gulwani,et al.  Constraint-Based Approach for Analysis of Hybrid Systems , 2008, CAV.

[27]  Henny B. Sipma,et al.  Constructing invariants for hybrid systems , 2004, Formal Methods Syst. Des..

[28]  Zohar Manna,et al.  Mathematical Theory of Computation , 2003 .

[29]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[30]  Lawrence C. Paulson,et al.  Applications of MetiTarski in the Verification of Control and Hybrid Systems , 2009, HSCC.

[31]  Carla Piazza,et al.  Algorithmic Algebraic Model Checking II: Decidability of Semi-algebraic Model Checking and Its Applications to Systems Biology , 2005, ATVA.

[32]  Ali Jadbabaie,et al.  Safety Verification of Hybrid Systems Using Barrier Certificates , 2004, HSCC.

[33]  André Platzer,et al.  The Complete Proof Theory of Hybrid Systems , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[34]  Ashish Tiwari,et al.  Generating Polynomial Invariants for Hybrid Systems , 2005, HSCC.

[35]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[36]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[37]  Ashish Tiwari,et al.  A Technique for Invariant Generation , 2001, TACAS.

[38]  Wang Yi,et al.  UPPAAL - a Tool Suite for Automatic Verification of Real-Time Systems , 1996, Hybrid Systems.

[39]  Ashish Tiwari Generating Box Invariants , 2008, HSCC.

[40]  Sriram Sankaranarayanan,et al.  Symbolic Model Checking of Hybrid Systems Using Template Polyhedra , 2008, TACAS.

[41]  Arnaldo Vieira Moura,et al.  Generating Invariants for Non-linear Hybrid Systems by Linear Algebraic Methods , 2010, SAS.

[42]  Sriram Sankaranarayanan,et al.  Automatic invariant generation for hybrid systems using ideal fixed points , 2010, HSCC '10.

[43]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[44]  André Platzer,et al.  KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description) , 2008, IJCAR.

[45]  Davide Bresolin,et al.  Reachability computation for hybrid systems with Ariadne , 2008 .

[46]  Arnaldo Vieira Moura,et al.  Morphisms for Non-trivial Non-linear Invariant Generation for Algebraic Hybrid Systems , 2009, HSCC.

[47]  Leonardo Mendonça de Moura,et al.  Cutting to the Chase , 2011, Journal of Automated Reasoning.