Skip to main content

Nonlinear Systems: Approximating Reach Sets

  • Conference paper
Hybrid Systems: Computation and Control (HSCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2993))

Included in the following conference series:

Abstract

We describe techniques to generate useful reachability information for nonlinear dynamical systems. These techniques can be automated for polynomial systems using algorithms from computational algebraic geometry. The generated information can be incorporated into other approaches for doing reachability computation. It can also be used when abstracting hybrid systems that contain modes with nonlinear dynamics. These techniques are most naturally embedded in the hybrid qualitative abstraction approach proposed by the authors previously. They also show that the formal qualitative abstraction approach is well suited for dealing with nonlinear systems.

Research of the first author was supported in part by the National Science Foundation under grant CCR-0311348, NASA Langley Research Center contract NAS1-00108 to Rannoch Corporation, and DARPA BioSpice contract DE-AC03-765F00098 to Lawrence Berkeley Laboratory. Second author was supported in part by the National Science Foundation under grant PHY-0140236.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dang, T., Ivancic, F.: Reachability analysis of hybrid systems via predicate abstraction. In: Tomlin and Greenstreet [28]

    Google Scholar 

  2. Alur, R., Dang, T., Ivancic, F.: Progress on reachability analysis of hybrid systems using predicate abstraction. In: Maler and Pnueli [20]

    Google Scholar 

  3. Alur, R., Henzinger, T., Lafferriere, G., Pappas, G.J.: Discrete abstractions of hybrid systems. Proceedings of the IEEE 88(2), 971–984 (2000)

    Article  Google Scholar 

  4. Anai, H., Weispfenning, V.: Reach set computations using real quantifier elimination. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 63–76. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Becker, T., Weispfenning, V.: Gröbner bases: a computational approach to commutative algebra. Springer, Berlin (1993)

    MATH  Google Scholar 

  6. Chutinan, A., Krogh, B.H.: Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations. In: Vaandrager and van Schuppen [29], pp. 76–90

    Google Scholar 

  7. Dang, T., Maler, O.: Reachability analysis via face lifting. In: Henzinger, T.A., Sastry, S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 96–109. Springer, Heidelberg (1998)

    Google Scholar 

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

    Google Scholar 

  9. Forsman, K., Glad, T.: Constructive algebraic geometry in nonlinear control. In: 29th CDC, vol. 5, pp. 2825–2827. IEEE, Los Alamitos (1990)

    Google Scholar 

  10. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72–83. Springer, Heidelberg (1997)

    Google Scholar 

  11. Henzinger, T.A., Ho, P.-H.: Algorithmic analysis of nonlinear hybrid systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 225–238. Springer, Heidelberg (1995)

    Google Scholar 

  12. Henzinger, T.A., Wong-Toi, H.: Linear phase-portrait approximations for nonlinear systems. In: Alur, R., Henzinger, T., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 377–388. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  13. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control 43, 540–554 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Krogh, B.H., Stursberg, O.: On efficient representation and computation of reachable sets for hybrid systems. In: Maler and Pnueli [20]

    Google Scholar 

  15. Kuipers, B.J.: Qualitative reasoning: Modeling and simulation with incomplete knowledge. MIT Press, Cambridge (1994)

    Google Scholar 

  16. Kurzhanski, A.B., Varaiya, P.: Ellipsoidal techniques for reachability analysis. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 202–214. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Lafferriere, G., Pappas, G.J., Sastry, S.: O-minimal hybrid systems. Mathematics of Control, Signals, and Systems 13(1), 1–21 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Lafferriere, G., Pappas, G.J., Yovine, S.: A new class of decidable hybrid systems. In: Vaandrager and van Schuppen [29], pp. 137–151

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Maler, O., Pnueli, A. (eds.): HSCC 2003. LNCS, vol. 2623. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  21. Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometric methods in robustness and optimization. PhD thesis, California Institute of Technology, Pasadena (2000)

    Google Scholar 

  22. Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. In: Algorithmic and quantitative real algebraic geometry. DIMACS series in discrete mathematics and theoretical computer science, vol. 60, pp. 83–99 (2003), http://www.arxiv.org/abs/math.OC/0103170

  23. Prajna, S., Papachristodoulou, A., Parrilo, P.A.: SOSTOOLS: Sum of square optimization toolbox for MATLAB (2002)

    Google Scholar 

  24. Sastry, S.: Nonlinear systems:Analysis, stability, and control. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  25. Tiwari, A.: Approximate reachability for linear systems. In: Maler and Pnueli [20], pp. 514–525

    Google Scholar 

  26. Tiwari, A., Khanna, G.: Series of abstractions for hybrid automata. In: Tomlin and Greenstreet [28], pp. 465–478

    Google Scholar 

  27. Tiwari, A., Wolf, D., Arkin, A., Lincoln, P.: Hybrid modeling and analysis of genetic regulatory networks: Sporulation initiation in bacillus subtilis (2003) (in preparation)

    Google Scholar 

  28. Tomlin, C.J., Greenstreet, M.R. (eds.): HSCC 2002. LNCS, vol. 2289. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  29. Vaandrager, F.W., van Schuppen, J.H. (eds.): HSCC 1999. LNCS, vol. 1569. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  30. Vidyasagar, M.: Nonlinear systems analysis. Prentice Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  31. Walther, U., Georgiou, T., Tannenbaum, A.: On the computation of switching surfaces in optimal control:A Gröbner basis approach. IEEE Transactions on Automatic Control 46(4) (2001)

    Google Scholar 

  32. Wolf, D., Arkin, A.: Survival strategy selection as an emergent property of ubernetwork topology. Lawrence Berkeley Laboratory, Berkeley (2003) (unpublished manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiwari, A., Khanna, G. (2004). Nonlinear Systems: Approximating Reach Sets. In: Alur, R., Pappas, G.J. (eds) Hybrid Systems: Computation and Control. HSCC 2004. Lecture Notes in Computer Science, vol 2993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24743-2_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24743-2_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21259-1

  • Online ISBN: 978-3-540-24743-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics