article

Constructing invariants for hybrid systems

Authors:

Sriram Sankaranarayanan,

Henny B. Sipma,

Zohar MannaAuthors Info & Claims

Formal Methods in System Design, Volume 32, Issue 1

Pages 25 - 55

https://doi.org/10.1007/s10703-007-0046-1

Published: 01 February 2008 Publication History

Abstract

We present a new method for generating algebraic invariants of hybrid systems. The method reduces the invariant generation problem to a constraint solving problem using techniques from the theory of ideals over polynomial rings. Starting with a template invariant--a polynomial equality over the system variables with unknown coefficients--constraints are generated on the coefficients guaranteeing that the solutions are inductive invariants. To control the complexity of the constraint solving, several stronger conditions that imply inductiveness are proposed, thus allowing a trade-off between the complexity of the invariant generation process and the strength of the resulting invariants.

References

[1]

Asarin E, Dang T, Maler O (2002) The d/dt tool for verification of hybrid systems. In: Proc 14th international conference on computer aided verification. LNCS, vol 2404. Springer, Berlin, pp 365-370.

[2]

Baader F, Nipkow T (1998) Term rewriting and all that. Cambridge University Press, Cambridge.

[3]

Bengtsson J, Larsen KG, Larsson F. Pettersson P, Yi W (1995) UPPAAL--a tool suite for automatic verification of real-time systems. In: Proc of workshop on verification and control of hybrid systems III. Oct 1995. LNCS, vol 1066. Springer, Berlin, pp 232-243.

[4]

Bensalem S, Bozga M, Fernandez J-C, Ghirvu L, Lakhnech Y (2000) A transformational approach for generating non-linear invariants. In: Static analysis symposium, June 2000. LNCS, vol 1824. Springer, Berlin.

[5]

Bockmayr A, Weispfenning V (2001) Solving numerical constraints, in: Robinson A, Voronkov A (eds) Handbook of automated reasoning, vol I. Elsevier, Amsterdam, pp 751-842. Chapter 12.

[6]

Collins GE, Hong H (1991) Partial cylindrical algebraic decomposition for quantifier elimination. J Symb Comput 12(3):299-328.

Digital Library

[7]

Colón M (2004) Approximating the algebraic relational semantics of imperative programs. In: 11th static analysis symposium (SAS'2004). LNCS, vol 3148. Springer, Berlin.

[8]

Colón M, Sankaranarayanan S, Sipma H (2003) Linear invariant generation using non-linear constraint solving. In: Somenzi F, Hunt W Jr (eds) Computer aided verification. LNCS, vol 2725. Springer, Berlin, pp 420-433.

[9]

Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM principles of programming languages, pp 238- 252.

[10]

Cousot P, Halbwachs N (1978) Automatic discovery of linear restraints among the variables of a program. In: ACM principles of programming languages, Jan 1978, pp 84-97.

[11]

Cox D, Little J, O'Shea D (1991) Ideals, varieties and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer, Berlin.

[12]

Forsman K (1991) Construction of Lyapunov functions using Gröbner bases. In: Proc 30th IEEE CDC.

[13]

Garey M, Johnson D (1999) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York.

[14]

Halbwachs N, Proy Y, Roumanoff P (1997) Verification of real-time systems using linear relation analysis. Formal Methods Syst Des 11(2):157-185.

Digital Library

[15]

Henzinger TA (1996) The theory of hybrid automata. In: Logic in computer science, LICS 1996. IEEE Computer Society, Los Alamitos, pp 278-292.

[16]

Henzinger T, Ho P-H (1995) Algorithmic analysis of nonlinear hybrid systems. In: Computer-aided verification. LNCS, vol 939. Springer, Berlin, pp 225-238.

[17]

Henzinger TA, Ho P (1995) HYTECH: the Cornell hybrid technology tool. In: Hybrid systems II. LNCS, vol 999. Springer, Berlin, pp 265-293.

[18]

Karr M (1976) Affine relationships among variables of a program. Acta Inf 6:133-151.

Digital Library

[19]

Lafferriere G, Pappas G, Yovine S (2001) Symbolic reachability computation for families of linear vector fields. J Symb Comput 32:231-253.

Digital Library

[20]

Manna Z, Pnueli A (1995) Temporal verification of reactive systems: safety. Springer, New York.

[21]

Mishra B, Yap C (1989) Notes on Gröbner bases, Inf Sci 48:219-252.

Digital Library

[22]

Müller-Olm M, Seidl H (2002) Polynomial constants are decidable. In: Static analysis symposium (SAS 2002). LNCS, vol 2477. Springer, Berlin, pp 4-19.

[23]

Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77(4):541-580.

[24]

Parillo PA (2003) Semidefinite programming relaxation for semialgebraic problems. Math Program Ser B 96(2):293-320.

[25]

Prajna S, Jadbabaie A (2004) Safety verification using barrier certificates. In: Hybrid systems: computation and control. LNCS, vol 2993. Springer, Berlin, pp 477-492.

[26]

Rodriguez-Carbonell E, Kapur D (2004) An abstract interpretation approach for automatic generation of polynomial invariants. In: 11th static analysis symposium (SAS'2004). LNCS, vol 3148. Springer, Berlin.

[27]

Rodriguez-Carbonell E, Kapur D (2004) Automatic generation of polynomial loop invariants: algebraic foundations. In: Proc international symp on symbolic and algebraic computation, ISSAC-2004, Spain.

[28]

Sankaranarayanan S, Sipma HB, Manna Z (2003) Petri net analysis using invariant generation. In: Verification: theory and practice. LNCS, vol 2772. Springer, Berlin, pp 682-701.

[29]

Sankaranarayanan S, Sipma H, Manna Z (2004) Non-linear loop invariant generation using Gröbner bases. In: ACM principles of programming languages (POPL). ACM, New York, pp 318-330.

[30]

Sankaranarayanan S, Sipma HB, Manna Z (2004) Constraint-based linear relations analysis. In: 11th static analysis symposium (SAS'2004). LNCS, vol 3148. Springer, Berlin, pp 53-68.

[31]

Silva B, Richeson K, Krogh B, Chutinan A (2000) Modeling and verifying hybrid dynamic systems using CheckMate. In: Proc conf on automation of mixed processes: hybrid dynamic systems, pp 323-328.

[32]

Tiwari A (2003) Approximate reachability for linear systems. In: Hybrid systems: computation and control HSCC. LNCS, vol 2623. Springer, Berlin, pp 514-525.

[33]

Tiwari A, Khanna G (2004) Non-linear systems: approximating reach sets. In: Hybrid systems: computation and control. LNCS, vol 2993. Springer, Berlin, pp 477-492.

[34]

Tiwari A, Rueß H, Saïdi H, Shankar N (2001) A technique for invariant generation. In: TACAS 2001. LNCS, vol 2031. Springer, Berlin, pp 113-127.

[35]

Windsteiger W, Buchberger B (1993) Gröbner: a library for computing Gröbner bases based on SACLIB. Tech rep, RISC-Linz.

[36]

Yovine S (1997) Kronos: a verification tool for real-time systems. Springer International J Softw Tools Technol Transf 1, 1/2, October 1997.

Cited By

Ghorbal KBridoux M(2024)Automated Reasoning For The Existence Of Darboux PolynomialsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669705(324-333)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669705
Berger GGhanbarpour MSankaranarayanan S(2024)Cone-Based Abstract Interpretation for Nonlinear Positive Invariant SynthesisProceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3641513.3650127(1-16)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3641513.3650127
Zhao QChen XZhao ZZhang YTang ELi XBartocci EPutot S(2022)Verifying Neural Network Controlled Systems Using Neural NetworksProceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3501710.3519511(1-11)Online publication date: 4-May-2022
https://dl.acm.org/doi/10.1145/3501710.3519511
Show More Cited By

Index Terms

Constructing invariants for hybrid systems

Recommendations

Automatic invariant generation for hybrid systems using ideal fixed points
HSCC '10: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control

We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differential equations with multivariate polynomial right-hand sides. Our approach ...
Scale Invariants from Gaussian-Geometric Moments
EITCE '21: Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering

The Gaussian geometric moment is obtained by adding a Gaussian kernel to the geometric moment, which has better characteristic expression ability and robustness than the geometric moment. Based on the construction theory of geometric moment invariants, ...
Implicit Moment Invariants

The use of traditional moment invariants in object recognition is limited to simple geometric transforms, such as rotation, scaling and affine transformation of the image. This paper introduces so-called implicit moment invariants. Implicit invariants ...

Comments

Information & Contributors

Information

Published In

cover image Formal Methods in System Design

Formal Methods in System Design Volume 32, Issue 1

February 2008

80 pages

ISSN:0925-9856

Issue’s Table of Contents

Copyright © Copyright © 2008 Springer Science+Business Media, LLC.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 February 2008

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Ghorbal KBridoux M(2024)Automated Reasoning For The Existence Of Darboux PolynomialsProceedings of the 2024 International Symposium on Symbolic and Algebraic Computation10.1145/3666000.3669705(324-333)Online publication date: 16-Jul-2024
https://dl.acm.org/doi/10.1145/3666000.3669705
Berger GGhanbarpour MSankaranarayanan S(2024)Cone-Based Abstract Interpretation for Nonlinear Positive Invariant SynthesisProceedings of the 27th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3641513.3650127(1-16)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3641513.3650127
Zhao QChen XZhao ZZhang YTang ELi XBartocci EPutot S(2022)Verifying Neural Network Controlled Systems Using Neural NetworksProceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control10.1145/3501710.3519511(1-11)Online publication date: 4-May-2022
https://dl.acm.org/doi/10.1145/3501710.3519511
Chen XSankaranarayanan S(2022)Reachability Analysis for Cyber-Physical Systems: Are We There Yet?NASA Formal Methods10.1007/978-3-031-06773-0_6(109-130)Online publication date: 24-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-06773-0_6
Zhao QChen XZhang YSha MYang ZLin WTang EChen QLi XBogomolov SJungers R(2021)Synthesizing ReLU neural networks with two hidden layers as barrier certificates for hybrid systemsProceedings of the 24th International Conference on Hybrid Systems: Computation and Control10.1145/3447928.3456638(1-11)Online publication date: 19-May-2021
https://dl.acm.org/doi/10.1145/3447928.3456638
Sogokon AMitsch STan YCordwell KPlatzer A(2021)Pegasus: sound continuous invariant generationFormal Methods in System Design10.1007/s10703-020-00355-z58:1-2(5-41)Online publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1007/s10703-020-00355-z
Jahandideh IGhassemi FSirjani M(2021)An actor-based framework for asynchronous event-based cyber-physical systemsSoftware and Systems Modeling (SoSyM)10.1007/s10270-021-00877-y20:3(641-665)Online publication date: 1-Jun-2021
https://dl.acm.org/doi/10.1007/s10270-021-00877-y
Platzer ATan Y(2020)Differential Equation Invariance AxiomatizationJournal of the ACM10.1145/338082567:1(1-66)Online publication date: 3-Apr-2020
https://dl.acm.org/doi/10.1145/3380825
Chen XPeng CLin WYang ZZhang YLi X(2020)A Novel Approach for Solving the BMI Problem in Barrier Certificates GenerationComputer Aided Verification10.1007/978-3-030-53288-8_29(582-603)Online publication date: 21-Jul-2020
https://dl.acm.org/doi/10.1007/978-3-030-53288-8_29
Borralleras CLarraz DRodríguez-Carbonell EOliveras ARubio A(2019)Incomplete SMT Techniques for Solving Non-Linear Formulas over the IntegersACM Transactions on Computational Logic10.1145/334092320:4(1-36)Online publication date: 17-Aug-2019
https://dl.acm.org/doi/10.1145/3340923
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents