Skip to main content
SpringerLink
Log in

Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Hybrid systems are dynamical systems with interacting discrete computation and continuous physical processes, which have become more common, more indispensable, and more complicated in our modern life. Particularly, many of them are safety-critical, and therefore are required to meet a critical safety standard. Invariant generation plays a central role in the verification and synthesis of hybrid systems. In the previous work, the fourth author and his coauthors gave a necessary and sufficient condition for a semi-algebraic set being an invariant of a polynomial autonomous dynamical system, which gave a confirmative answer to the open problem. In addition, based on which a complete algorithm for generating all semi-algebraic invariants of a given polynomial autonomous hybrid system with the given shape was proposed. This paper considers how to extend their work to non-autonomous dynamical and hybrid systems. Non-autonomous dynamical and hybrid systems are with inputs, which are very common in practice; in contrast, autonomous ones are without inputs. Furthermore, the authors present a sound and complete algorithm to verify semi-algebraic invariants for non-autonomous polynomial hybrid systems. Based on which, the authors propose a sound and complete algorithm to generate all invariants with a pre-defined template.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alur R, Courcoubetis C, Henzinger T, et al., Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems, Proceedings of Hybrid Systems, LNCS, Springer Berlin. Heldelberg, 1992, 736: 209–229.

    MathSciNet  Google Scholar 

  2. Asarin E, Bournez O, Dang T, et al., Approximate reachability analysis of piecewise-linear dynamical systems, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heldelberg, 2000, 1790: 20–31.

    MATH  Google Scholar 

  3. Lafferriere G, Pappas G, and Yovine S, Symbolic reachability computation for families of linear vector fields. Journal of Symbolic Computation, 2001, 32(3): 231–253.

    Article  MathSciNet  MATH  Google Scholar 

  4. Alur R, Dang T, and Ivancic F, Predicate abstraction for reachability analysis of hybrid systems. ACM Trasactions on Embedded Computing Systems, 2006, 5(1): 152–199.

    Article  MATH  Google Scholar 

  5. Gan T, Chen M, Dai L, et al., Decidability of the reachability for a family of linear vector fields, Proceedings of International Symposium on Automated Technology for Verification and Analysis, LNCS, Springer Berlin. Heldelberg, 2015, 9364: 482–499.

    Article  MATH  Google Scholar 

  6. Gan T, Chen M, Li Y, et al., Computing reachable sets of linear vector fields revisited, Proceedings of European Control Conference, Aalborg, 2016.

    Google Scholar 

  7. Prajna S and Jadbabaie A, Safety verification of hybrid systems using barrier certificates, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heldelberg, 2004, 2993: 477–492.

    MATH  Google Scholar 

  8. Sankaranarayanan S, Sipma H, and Manna Z, Constructing invariants for hybrid systems, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heldelberg, 2004, 2993: 539–554.

    MATH  Google Scholar 

  9. Gulwani S and Tiwari A, Constraint-based approach for analysis of hybrid systems, Proceedings of International Conference on Computer Aided Verification, LNCS, Springer Berlin. Heldelberg, 2008, 5123: 190–203.

    MATH  Google Scholar 

  10. Platzer A and Clarke E, Computing differential invariants of hybrid systems as fixedpoints, Proceedings of International Conference on Computer Aided Verification, LNCS, Springer Berlin. Heldelberg, 2008, 5123: 176–189.

    MATH  Google Scholar 

  11. Liu J, Zhan N, and Zhao H, Computing semi-algebraic invariants for polynomial dynamical systems. Proceedings of ACM International Conference on Embedded Software, 2011, 97–106.

    Google Scholar 

  12. Dai L, Gan T, Xia B, et al., Barrier certificate revisited, Journal of Symbolic Computation, 2016, 80(1): 62–86.

    MathSciNet  MATH  Google Scholar 

  13. Asarin E, Bournez O, Dang T, et al., Effective synthesis of switching controllers for linear systems, Proceedings of the IEEE, 2000, 88(7): 1011–1025.

    Article  Google Scholar 

  14. Tomlin C, Lygeros J, and Sastry S, A game theoretic approach to controller design for hybrid systems, Proceedings of the IEEE, 2000, 88(7): 949–970.

    Article  Google Scholar 

  15. Taly A and Tiwari A, Deductive verification of continuous dynamical systems, LProceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. IPIcs, 2009, 4: 383–394.

    MathSciNet  MATH  Google Scholar 

  16. Sturm T and Tiwari A, Verification and synthesis using real quantifier elimination. Proceedings of International Symposium on Symbolic and Algebraic Computation, 2011, 329–336.

    Google Scholar 

  17. Zhao H, Zhan N, Kapur D, et al., A “hybrid” approach for synthesizing optimal controllers of hybrid systems: A case study of the oil pump industrial example, Proceedings of International Symposium on Formal Methods, LNCS, Springer Berlin. Heldelberg, 2012, 7436: 471–485.

    MathSciNet  MATH  Google Scholar 

  18. Zhao H, Zhan N, and Kapur D, Synthesizing switching controllers for hybrid systems by generating invariants, Proceedings of Theories of Programming and Formal Methods, LNCS, Springer Berlin. Heidelberg, 2013, 8051: 354–373.

    Google Scholar 

  19. Bensalem S, Bozga M, Fernandez J C, et al., A transformational approach for generating nonlinear invariants, Proceedings of 7th International Symposium on Static Analysis, LNCS, 2000, 1824: 58–74.

    MATH  Google Scholar 

  20. Colon M, Sankaranarayanan S, and Sipma H, Linear invariant generation using non-linear constraint solving, Proceedings of International Conference on Computer Aided Verification, LNCS, Springer Berlin. Heidelberg, 2003, 2725: 420–432.

    MathSciNet  MATH  Google Scholar 

  21. Sankaranarayanan S, Sipma H, and Manna Z, Non-linear loop invariant generation using gröbner bases, Proceedings of Symoisium on Principles of Programming Languages, 2004, 318–329.

    Google Scholar 

  22. Kapur D, Automatically generating loop invariants using quantifier elimination, Proceedings of Conferences on Applications of Computer Algebra. Beaumout, 2004.

    Google Scholar 

  23. Liu L, Lü J, Quan Z, et al., A calculus for hybrid CSP, Proceedings of Asian Symposium on Programming Languages and Systems, LNCS, Springer Berlin. Heidelberg, 2010, 6461: 1–15.

    Google Scholar 

  24. Platzer A, Analysis of Hybrid Systems: Proving Theorems for Complex Dynamics, Springer Berlin, Heidelberg, 2010.

    Book  MATH  Google Scholar 

  25. Sankaranarayanan S, Automatic abstraction of non-linear systems using change of bases transformations, Proceedings of International Conference on Hybrid Systems: Computation and Control. Chicago, 2011, 143–152.

    Google Scholar 

  26. Platzer A, A differential operator approach to equational differential invariants, Proceedings of International Conference on Interactive Theorem Proving, LNCS, Springer Berlin. Heidelberg, 2012, 7406: 28–48.

    Article  MathSciNet  MATH  Google Scholar 

  27. Platzer A, The complete proof theory of hybrid systems. Proceedings of Logic in Computer Science, 2012, 541–550.

    Google Scholar 

  28. Jirstrand M, Invariant sets for a class of hybrid systems. Proceedings of IEEE Conference on Decision and Control, 1998, 4: 3699–3704.

    Google Scholar 

  29. Rodríguez-Carbonell E and Tiwari A, Generating polynomial invariants for hybrid systems, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heidelberg, 2005, 3414: 590–605.

    MATH  Google Scholar 

  30. Sankaranarayanan S, Automatic invariant generation for hybrid systems using ideal fixed points. Proceedings of Hybrid Systems: Computation and Control, 2010, 221–230.

    Google Scholar 

  31. Prajna S and Jadbabaie A, Safety verification of hybrid systems using barrier certificates, Proceedings of Hybrid Systems: Computation and Control, LNCS, Springer Berlin. Heidelberg, 2004, 2993: 477–492.

    MATH  Google Scholar 

  32. Prajna S, Jadbabaie A, and Pappas G, A framework for worst-case and stochastic safety verification using barrier certificates, IEEE Transactions on Automatic Control, 2007, 52(8): 1415–1428.

    Article  MathSciNet  Google Scholar 

  33. Kong H, He F, Song X, et al., Exponential-condition-based barrier certificate generation for safety verification of hybrid systems, Proceedings of International Conference on Computer Aided Verification, LNCS, Springer Berlin. Heidelberg, 2013, 8044: 242–257.

    MathSciNet  Google Scholar 

  34. Sloth C, Pappas G, and Wisniewski R, Compositional safety analysis using barrier certificates. Proceedings of Hybrid Systems: Computation and Control, 2012, 15–24.

    Google Scholar 

  35. Moreno-Socias G, Length of polynomial ascending chains and primitive recursiveness. Mathematica Scandinavica, 1992, 71: 181–205.

    Article  MathSciNet  MATH  Google Scholar 

  36. Figueira D, Figueira S, Schmitz S, et al., Ackermannian and primitive-recursive bounds with Dickson’s lemma, Proceedings of Logic in Computer Science, 2011, 269–278.

    Google Scholar 

  37. Kong H, Bogomolov S, Schilling C, et al., Invariant clusters for hybrid systems, CoRR, abs/1605. 01450, 2016.

    Google Scholar 

  38. Cox D, Little J, and O’shea D, Ideals, Varieties, and Algorithms, Springer, 1992.

    Book  MATH  Google Scholar 

  39. Tenenbaum M and Pollard H, Ordinary Differential Equations: An Elementary Textbook for Students of Mathematics, Engineering, and the Sciences. Courier Corporation, 1963, 562–563.

    Google Scholar 

  40. Xia B, DISCOVERER: A tool for solving semi-algebraic systems, ACM Communications in Computer Algebra, 2007, 41(3): 102–103.

    Article  Google Scholar 

  41. Li Y, Lu H, Zhan N, et al., Termination analysis of polynomial programs with equality conditions, Computer Science, 2016, 6(4): 45–14.

    Google Scholar 

  42. Buchberger B, An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Journal of Symbolic Computation, 2006, 41(3–4): 475–511.

    Article  MathSciNet  MATH  Google Scholar 

  43. Liu J, Zhan N, and Zhao H, Computing semi-algebraic invariants for polynomial dynamical systems. ACM International Conference on Embedded Software, 2011, 97–106.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Qiuye Wang, Yangjia Li & Naijun Zhan

  2. LMAM & School of Mathematical Sciences, Peking University, Beijing, 100871, China

    Bican Xia

Authors
  1. Qiuye Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yangjia Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bican Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naijun Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qiuye Wang.

Additional information

The first, second and fourth authors are supported partly by “973 Program” under Grant No. 2014CB340701, by the National Natural Science Foundation of China under Grant Nos. 61625205, 91418204 and 61625206, by CDZ Project CAP (GZ 1023), and by the CAS/SAFEA International Partnership Program for Creative Research Teams; the third author is supported partly by the National Natural Science Foundation of China under Grant Nos. 11290141, 11271034 and 61532019.

This paper was recommended for publication by Editor-in-Chief GAO Xiao-Shan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Q., Li, Y., Xia, B. et al. Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems. J Syst Sci Complex 30, 234–252 (2017). https://doi.org/10.1007/s11424-017-6226-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-017-6226-1

Keywords

Search

Navigation