Skip to main content

A Topological Method for Finding Invariant Sets of Continuous Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9328))

Abstract

A usual way to find positive invariant sets of ordinary differential equations is to restrict the search to predefined finitely generated shapes, such as linear templates, or ellipsoids as in classical quadratic Lyapunov function based approaches. One then looks for generators or parameters for which the corresponding shape has the property that the flow of the ODE goes inwards on its border. But for non-linear systems, where the structure of invariant sets may be very complicated, such simple predefined shapes are generally not well suited. The present work proposes a more general approach based on a topological property, namely Ważewski’s property. Even for complicated non-linear dynamics, it is possible to successfully restrict the search for isolating blocks of simple shapes, that are bound to contain non-empty invariant sets. This approach generalizes the Lyapunov-like approaches, by allowing for inwards and outwards flow on the boundary of these shapes, with extra topological conditions. We developed and implemented an algorithm based on Ważewski’s property, SOS optimization and some extra combinatorial and algebraic properties, that shows very nice results on a number of classical polynomial dynamical systems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, W.W., Loustaunau, P.: American mathematical society. An introduction to Grobner bases, Graduate studies in mathematics (1994)

    Google Scholar 

  2. Adjé, A., Garoche, P.-L.: Automatic synthesis of piecewise linear quadratic invariants for programs. In: D’Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 99–116. Springer, Heidelberg (2015)

    Google Scholar 

  3. Bacciotti, A., Mazzi, L.: Stability of dynamical polysystems via families of Lyapunov functions. Jour. Nonlin. Analysis (2007)

    Google Scholar 

  4. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer (2006)

    Google Scholar 

  5. Bhatia, N.P., Hájek, O.: Local Semi-dynamical Systems, vol. 90. Lecture Notes in Mathematics. Springer (1969)

    Google Scholar 

  6. Boczko, E., Kalies, W.D., Mischaikow, K.: Polygonal approximation of flows. Topology and its Applications 154 (2007)

    Google Scholar 

  7. Bouissou, O., Chapoutot, A., Djaballah, A., Kieffer, M.: Computation of parametric barrier functions for dynamical systems using interval analysis. In: IEEE CDC 2014 (2014)

    Google Scholar 

  8. Conley, C.: Isolated invariant sets and the Morse index. Amer. Math. Soc., CBMS Regional Conf. Series Math. 38 (1978)

    Google Scholar 

  9. Dang, T., Testylier, R.: Reachability analysis for polynomial dynamical systems using the Bernstein expansion. Reliable Computing 17, 128–152 (2012)

    MathSciNet  Google Scholar 

  10. Ghorbal, K., Platzer, A.: Characterizing algebraic invariants by differential radical invariants. In: Ábrahám, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 279–294. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Goubault, E., Jourdan, J.-H., Putot, S., Sankaranarayanan, S.: Finding non-polynomial positive invariants and Lyapunov functions for polynomial systems through Darboux polynomials. In: American Control Conference (2014)

    Google Scholar 

  12. Goubault, E., Mullier, O., Putot, S., Kieffer, M.: Inner approximated reachability analysis. In: HSCC, pp. 163–172 (2014)

    Google Scholar 

  13. Hazewinkel, M.: Alexander duality. Encyclopaedia of Mathematics (2002)

    Google Scholar 

  14. Wesley Wilson Jr., F., Yorke, J.A.: Lyapunov functions and isolating blocks. Journal of Differential Equations (1973)

    Google Scholar 

  15. Khali, H.K.: Nonlinear Systems. Prentice Hall (2002)

    Google Scholar 

  16. Lang, S.: Algebra. Graduate Texts in Mathematics. Springer, New York (2002)

    Google Scholar 

  17. Lasserre, J.-B.: Moments, positive polynomials and their applications, vol. 1. World Scientific (2009)

    Google Scholar 

  18. Lombardi, H.: Une borne sur les degrés pour le theorème des zéros rééls effectifs. In Real Algebraic Geometry, vol. 1524. Lecture Notes in Mathematics, pp. 323–345. Springer (1992)

    Google Scholar 

  19. Lombardi, H., Perrucci, D., Roy, M.-F.: An elementary recursive bound for effective positivstellensatz and Hilbert 17th problem (2014)

    Google Scholar 

  20. Mischaikow, K., Mrozek, M.: Conley index theory. In: Fiedler, B. (ed.) Handbook of Dynamical Systems II: Towards Applications, North-Holland (2002)

    Google Scholar 

  21. Mrozek, M.: Index pairs algorithms. Foundations of Computational Mathematics 6(4), 457–493 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  22. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana University Mathematics Journal 42(3), 969–984 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  23. Srzednicki, R.: Ważewski Method and Conley Index (2004)

    Google Scholar 

  24. Sankaranarayanan, S., Dang, T., Ivančić, F.: A policy iteration technique for time elapse over template polyhedra. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol. 4981, pp. 654–657. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25–41. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  26. Shorten, R., Wirth, F., Mason, O., Wulff, K., King, C.: Stability criteria for switched and hybrid systems. SIAM Rev. 49(4), 545–592

    Google Scholar 

  27. Guillermo Moreno Socías: Length of polynomial ascending chains and primitive recursiveness. 71, 181–205 (1992)

    Google Scholar 

  28. Stephens, T., Wanner, T.: Rigorous validation of isolating blocks for flows and their Conley indices. Technical report, IMA Preprint Series #2424 (May 2014)

    Google Scholar 

  29. Szymczak, A.: A combinatorial procedure for finding isolating neighbourhoods and index pairs. Proceedings of the Royal Society of Edinburgh: Section A Mathematics 127, 1075–1088 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  30. Vidyasagar, M.: Nonlinear Systems Analysis, Networks Series. Prentice-Hall (1978)

    Google Scholar 

  31. Ważewski, T.: Sur un principe topologique de l’examen de l’allure asymptotique des intégrales des équations différentielles ordinaires. Ann. Soc. Polon. Math. 10(25), 279–313 (1947)

    MATH  Google Scholar 

  32. Welker, V., Ziegler, G.M., Živaljević, R.T.: Homotopy colimits - comparison lemmas for combinatorial applications. J. Reine Angew. Math. 509, 117–149 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eric Goubault .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fribourg, L., Goubault, E., Mohamed, S., Mrozek, M., Putot, S. (2015). A Topological Method for Finding Invariant Sets of Continuous Systems. In: Bojanczyk, M., Lasota, S., Potapov, I. (eds) Reachability Problems. RP 2015. Lecture Notes in Computer Science(), vol 9328. Springer, Cham. https://doi.org/10.1007/978-3-319-24537-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24537-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24536-2

  • Online ISBN: 978-3-319-24537-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics