Guillaume Berger
ABSTRACT
We present an abstract interpretation approach for synthesizing nonlinear (semi-algebraic) positive invariants for systems of polynomial ordinary differential equations (ODEs) and switched systems. The key behind our approach is to connect the system under study to a positive nonlinear system through a “change of variables”. The positive invariance of the first orthant (<Formula format="inline"><TexMath><?TeX $\mathbb {R}_+$?></TexMath><AltText>Math 1</AltText><File name="hscc24-10-inline1" type="svg"/></Formula>) for a positive system guarantees, in turn, that the functions involved in the change of variables define a positive invariant for the original system. The challenge lies in discovering such functions for a given system. To this end, we characterize positive invariants as fixed points under an operator that is defined using the Lie derivative. Next, we use abstract-interpretation approaches to systematically compute this fixed point. Whereas abstract interpretation has been applied to the static analysis of programs, and invariant synthesis for hybrid systems to a limited extent, we show how these approaches can compute fixed points over cones generated by polynomials using sum-of-squares optimization and its relaxations. Our approach is shown to be promising over a set of small but hard-to-analyze nonlinear models, wherein it is able to generate positive invariants to place useful bounds on their reachable sets.
- Amir Ali Ahmadi and Anirudha Majumdar. 2019. DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization. SIAM Journal on Applied Algebra and Geometry 3, 2 (2019), 193–230. https://doi.org/10.1137/18M118935XGoogle Scholar
Cross Ref
- Daniele Ahmed, Andrea Peruffo, and Alessandro Abate. 2020. Automated and sound synthesis of Lyapunov functions with SMT solvers. In Tools and Algorithms for the Construction and Analysis of Systems: 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings, Part I 26. Springer, 97–114.Google ScholarDigital Library
- Fernando Alegre, Eric Feron, and Santosh Pande. 2009. Using Ellipsoidal Domains to Analyze Control Systems Software. CoRR abs/0909.1977 (2009). arXiv:0909.1977http://arxiv.org/abs/0909.1977Google Scholar
- Rajeev Alur. 2015. Principles of Cyber-Physical Systems. MIT Press.Google Scholar
- Rajeev Alur, Thao Dang, and Franjo Ivančić. 2006. Predicate Abstraction for Reachability Analysis of Hybrid Systems. ACM Trans. Embed. Comput. Syst. 5, 1 (feb 2006), 152–199. https://doi.org/10.1145/1132357.1132363Google ScholarDigital Library
- R. Alur, T.A. Henzinger, G. Lafferriere, and G.J. Pappas. 2000. Discrete abstractions of hybrid systems. Proc. IEEE 88, 7 (2000), 971–984. https://doi.org/10.1109/5.871304Google ScholarCross Ref
- Aaron D. Ames, Samuel Coogan, Magnus Egerstedt, Gennaro Notomista, Koushil Sreenath, and Paulo Tabuada. 2019. Control Barrier Functions: Theory and Applications. In European Control Conference (ECC). 3420–3431. https://doi.org/10.23919/ECC.2019.8796030Google ScholarCross Ref
- Mahathi Anand, Vishnu Murali, Ashutosh Trivedi, and Majid Zamani. 2021. Safety Verification of Dynamical Systems via K-Inductive Barrier Certificates. In 2021 60th IEEE Conference on Decision and Control (CDC) (Austin, TX, USA). IEEE Press, 1314–1320. https://doi.org/10.1109/CDC45484.2021.9682889Google ScholarDigital Library
- MOSEK ApS. 2022. The MOSEK optimization toolbox for MATLAB manual. Version 10.0.http://docs.mosek.com/9.0/toolbox/index.htmlGoogle Scholar
- Vladimir I. Arnold. 2006. Ordinary Differential Equations. Springer (Universitext). Translated from Russian by R.Cooke..Google Scholar
- Aharon Ben-Tal and Arkadi Nemirovski. 2001. Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM.Google Scholar
- Dimitris Bertsimas and Santosh Vempala. 2002. Solving Convex Programs by Random Walks. In Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing (Montreal, Quebec, Canada) (STOC ’02). Association for Computing Machinery, New York, NY, USA, 109–115. https://doi.org/10.1145/509907.509926Google ScholarDigital Library
- Franco Blanchini and Stefano Miani. 2008. Set-Theoretic Methods in Control. Birkhäuser, Boston, MA, USA. https://link.springer.com/book/10.1007/978-0-8176-4606-6Google Scholar
- Patrick Cousot. 2021. Principles of Abstract Interpretation. The MIT Press, Cambridge, MA, USA. https://www.amazon.com/Principles-Abstract-Interpretation-Patrick-Cousot/dp/0262044900Google Scholar
- Patrick Cousot and Rhadia Cousot. 1977. Abstract Interpretation: A unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In ACM Principles of Programming Languages. 238–252.Google ScholarDigital Library
- Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, and Xavier Rival. 2005. The ASTRÉE Analyzer. In European Symposium on Programming (ESOP’05)(Lecture Notes in Computer Science, Vol. 3444), M. Sagiv (Ed.). Springer-Verlag, 21–30.Google Scholar
- Leonardo De Moura and Nikolaj Bjørner. 2008. Z3: An efficient SMT solver. In International conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer, 337–340.Google ScholarCross Ref
- Komei Fukuda. 2003. Cddlib reference manual. Report version 093a, McGill University, Montréal, Quebec, Canada (2003).Google Scholar
- Nathan Fulton, Stefan Mitsch, Jan-David Quesel, Marcus Völp, and André Platzer. 2015. KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems. In CADE(LNCS, Vol. 9195), Amy P. Felty and Aart Middeldorp (Eds.). Springer, 527–538. https://doi.org/10.1007/978-3-319-21401-6_36Google ScholarCross Ref
- Khalil Ghorbal, Andrew Sogokon, and André Platzer. 2017. A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets. Computer Languages, Systems & Structures 47 (Jan. 2017), 19–43. https://doi.org/10.1016/j.cl.2015.11.003Google ScholarCross Ref
- Nicolas Halbwachs, Yann Eric Proy, and Pascal Raymond. 1994. Verification of linear hybrid systems by means of convex approximations. In Static Analysis, Baudouin Le Charlier (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 223–237.Google Scholar
- Thomas A. Henzinger and Pei-Hsin Ho. 1995. A note on abstract interpretation strategies for hybrid automata. In Hybrid Systems II, Panos Antsaklis, Wolf Kohn, Anil Nerode, and Shankar Sastry (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 252–264.Google Scholar
- Tadeusz Kaczorek and Kamil Borawski. 2017. Stability of positive nonlinear systems. In 2017 22nd International Conference on Methods and Models in Automation and Robotics (MMAR). IEEE, 564–569.Google ScholarCross Ref
- Jean B Lasserre. 2001. Global optimization with polynomials and the problem of moments. SIAM Journal on optimization 11, 3 (2001), 796–817.Google Scholar
- Benoît Legat. 2023. Polyhedral Computation. In JuliaCon. https://pretalx.com/juliacon2023/talk/JP3SPX/Google Scholar
- Jiang Liu, Naijun Zhan, and Hengjun Zhao. 2011. Computing Semi-Algebraic Invariants for Polynomial Dynamical Systems. In Proc. of ACM International Conference on Embedded Software (EMSOFT) (Taipei, Taiwan) (EMSOFT ’11). Association for Computing Machinery, New York, NY, USA, 97–106.Google ScholarDigital Library
- László Lovász and Santosh Vempala. 2006. Hit-and-Run from a Corner. SIAM J. Comput. 35, 4 (2006), 985–1005.Google ScholarDigital Library
- James D. Meiss. 2017. Differential Dynamical Systems. SIAM.Google Scholar
- Sayan Mitra. [n. d.]. Verifying Cyber-Physical Systems: A Path to Safe Autonomy. MIT Press. https://mitpress.mit.edu/contributors/sayan-mitraGoogle Scholar
- M. Nagumo. 1942. Uber die lage der integralkurven gewöhnlicher differentialgleichungen. 24 (1942), 551–559. Issue 3.Google Scholar
- Pablo A. Parrilo. [n. d.]. Polynomial Optimization, Sums of Squares, and Applications. Chapter 3, 47–157. https://doi.org/10.1137/1.9781611972290.ch3Google ScholarCross Ref
- André Platzer. 2010. Logical Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics. Springer, Heidelberg. https://doi.org/10.1007/978-3-642-14509-4Google ScholarCross Ref
- André Platzer. 2017. A Complete Uniform Substitution Calculus for Differential Dynamic Logic. J. Autom. Reas. 59, 2 (2017), 219–265. https://doi.org/10.1007/s10817-016-9385-1Google ScholarDigital Library
- André Platzer. 2018. Logical Foundations of Cyber-Physical Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-63588-0Google ScholarCross Ref
- André Platzer and Edmund M. Clarke. 2008. Computing Differential Invariants of Hybrid Systems as Fixedpoints. In Computer Aided Verification, Aarti Gupta and Sharad Malik (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 176–189.Google Scholar
- Stephen Prajna and Ali Jadbabaie. 2004. Safety Verification of Hybrid Systems Using Barrier Certificates. In Hybrid Systems: Computation and Control, Rajeev Alur and George J. Pappas (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 477–492.Google Scholar
- Stephen Prajna, Ali Jadbabaie, and George J. Pappas. 2007. A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates. IEEE Trans. Automat. Control 52, 8 (2007), 1415–1428. https://doi.org/10.1109/TAC.2007.902736Google ScholarCross Ref
- Pierre Roux, Romain Jobredeaux, Pierre-Loïc Garoche, and Éric Féron. 2012. A generic ellipsoid abstract domain for linear time invariant systems. In Proceedings of Hybrid Systems: Computation and Control (Beijing, China) (HSCC ’12). Association for Computing Machinery, New York, NY, USA, 105–114.Google ScholarDigital Library
- Ricardo Sanfelice. 2021. Hybrid Feedback Control.Google Scholar
- Sriram Sankaranarayanan. 2011. Automatic Abstraction of Non-Linear Systems Using Change of Variables Transformations. In Hybrid Systems: Computation and Control (HSCC). ACM Press, 143–152.Google Scholar
- Sriram Sankaranarayanan. 2016. Change of Basis Abstractions for Non-Linear Hybrid Systems. Nonlinear Analysis: Hybrid Systems 19 (2016), 107–133.Google ScholarCross Ref
- Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. 2006. Fixed Point Iteration for Computing the Time Elapse Operator. In HSCC(Lecture Notes in Computer Science, Vol. 3927). Springer, 537–551.Google Scholar
- Sriram Sankaranarayanan, Henny Sipma, and Zohar Manna. 2008. Constructing Invariants for Hybrid Systems. Formal Methods in System Design 32, 1 (2008), 25–55.Google ScholarDigital Library
- K. Schmüdgen. 1991. The k-moment problem for compact semi-algebraic sets. Math. Ann. 289 (1991), 203–206.Google ScholarCross Ref
- Naum Z. Shor. 1987. An Approach to Obtaining Global Extrema in Polynomial Problems of Mathematical Programming. Kibernetika (Kiev)5 (1987), 102–6. Issue 136.Google Scholar
- Andrew Sogokon, Khalil Ghorbal, Yong Kiam Tan, and André Platzer. 2018. Vector barrier certificates and comparison systems. In FM’18, K. Havelund, J. Peleska, B. Roscoe, and E. de Vink (Eds.). Vol. 10951. Springer, 418–437.Google Scholar
- Yunfei Song. 2022. Positive Invariance Condition for Continuous Dynamical Systems Based on Nagumo Theorem. arxiv:2207.05429 [math.DS]Google Scholar
- Thomas Sturm and Ashish Tiwari. 2011. Verification and Synthesis Using Real Quantifier Elimination. In Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation (San Jose, California, USA) (ISSAC ’11). Association for Computing Machinery, New York, NY, USA, 329–336. https://doi.org/10.1145/1993886.1993935Google ScholarDigital Library
- Ankur Taly and Ashish Tiwari. 2009. Deductive Verification of Continuous Dynamical Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 4). 383–394.Google Scholar
- A. Tiwari and G. Khanna. 2002. Series of Abstractions for Hybrid Automata. In Hybrid Systems: Computation and Control HSCC(LNCS, Vol. 2289), C. J. Tomlin and M. R. Greenstreet (Eds.). Springer, 465–478.Google Scholar
- A. Tiwari and G. Khanna. 2004. Nonlinear systems: Approximating reach sets. In Hybrid Systems: Computation and Control HSCC(LNCS, Vol. 2993), R. Alur and G. Pappas (Eds.). Springer, 600–614.Google Scholar
- C.J. Tomlin, I. Mitchell, A.M. Bayen, and M. Oishi. 2003. Computational techniques for the verification of hybrid systems. Proc. IEEE 91, 7 (2003), 986–1001. https://doi.org/10.1109/JPROC.2003.814621Google ScholarCross Ref
- Tillmann Weisser, Benoît Legat, Chris Coey, Lea Kapelevich, and Juan Pablo Vielma. 2019. Polynomial and Moment Optimization in Julia and JuMP. In JuliaCon. https://pretalx.com/juliacon2019/talk/QZBKAU/Google Scholar
Recommendations
Generic radial orthogonal moment invariants for invariant image recognition
As the variation of parameters in Jacobi polynomial, Jacobi-Fourier moments can form various types of orthogonal moments: Legendre-Fourier moments, Orthogonal Fourier-Mellin moments, Zernike moments, pseudo-Zernike moments, and so on. In this paper, we ...
3D radial invariant of dual Hahn moments
In this work, we propose new sets of 2D and 3D rotation invariants based on orthogonal radial dual Hahn moments, which are orthogonal on a non-uniform lattice. We also present theoretical mathematics to derive them. Thus, this paper presents in the ...
Radial invariant of 2D and 3D Racah moments
In this paper, we introduce new sets of 2D and 3D rotation, scaling and translation invariants based on orthogonal radial Racah moments. We also provide theoretical mathematics to derive them. Thus, this work proposes in the first case a new 2D radial ...
Comments