Skip to main content

Computing Reachable Sets of Differential Inclusions

  • Chapter
  • First Online:
Coordination Control of Distributed Systems

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 456))

  • 1862 Accesses

Abstract

Differential inclusions are mathematical models of nondeterministic continuous-time systems for which no stochastic information on the behavior is known. They arise naturally as reduced models of deterministic systems or as models of components of a distributed system with partial knowledge of the inputs. In order to verify that such systems satisfy safety specifications, we need to compute rigorous over-approximations to the set of reachable states. In this essay, we outline such a method, which gives high-order error for a single time step and a uniform bound on the error over the finite time interval. The approach is based on the approximations of inputs by finitely parametrized functions at each time step.

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 EPUB and 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

References

  1. Aubin JP, Cellina A (1984) Differential inclusions: set-valued maps and viability theory. Grundlehren der Mathematischen Wissenschaften, 264. Springer, Berlin

    Google Scholar 

  2. Kurzhanski A, Valyi I (1997) Ellipsoidal calculus for estimation and control (English summary). Systems and control: foundations and applications. Birkhà user Boston Inc, Boston, MA; International Institute for Applied Systems Analysis, Laxenburg

    Google Scholar 

  3. Zgliczynski P, Kapela TA (2009) Lohner algorithm for perturbation of ODEs and differential inclusions. Discrete Contin Dyn Syst Ser B 11(2):365–385

    MathSciNet  MATH  Google Scholar 

  4. Puri A, Borkar V, Varaiya P (1995) \(\epsilon \)-approximation of differential inclusions. In: Proceedings of the 34th IEEE conference on decision and control, pp 2892–2897

    Google Scholar 

  5. Beyn W-J, Rieger J (2007) Numerical fixed grid methods for differential inclusions (English summary). Computing 81(1):91–106

    Article  MathSciNet  MATH  Google Scholar 

  6. Baier R, Gerdts M (2009) A computational method for non-convex reachable sets using optimal control. In: Proceedings of the European control conference 2009, Budapest, Hungary, pp 97–102

    Google Scholar 

  7. Dontchev A, Lempio F (1992) Difference methods for differential inclusions: a survey. SIAM Rev 34(2):263–294

    Article  MathSciNet  MATH  Google Scholar 

  8. Dontchev T (2002) Euler approximation of nonconvex discontinuous differential inclusions (English summary). An Stiint Univ Ovidius Constanta Ser Mat 10(1):73–86

    Google Scholar 

  9. Dontchev AL, Farkhi EM (1989) Error estimates for discretized differential inclusion. Computing 41(4):349–358

    Article  MathSciNet  MATH  Google Scholar 

  10. Grammel G (2003) Towards fully discretized differential inclusions. Set-Valued Anal 11(1):1–8

    Article  MathSciNet  MATH  Google Scholar 

  11. Živanović Gonzalez S, Collins P (2010) Numerical solutions to noisy systems. In: Proceedings of the 49th IEEE conference on decision and control

    Google Scholar 

  12. Živanović Gonzalez S, Collins P (2010) Higher order methods for differential inclusions. CWI technical report

    Google Scholar 

  13. Makino K, Berz M (2003) Taylor models and other validated functional inclusion methods. Int J Pure Appl Math 4(4):379–456

    MathSciNet  MATH  Google Scholar 

  14. Revol N, Makino K, Berz M (2005) Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY. J Log Algebr Program 64(1):135–154

    Article  MathSciNet  MATH  Google Scholar 

  15. Söderlind G (2006) The logarithmic norm. History and modern theory (English summary). BIT 46(3):631–652

    Article  MathSciNet  MATH  Google Scholar 

  16. Benvenuti L, Bresolin D, Casagrande A, Collins P, Ferrari A, Mazzi E, Sangiovanni-Vincentelli A, Villa T (2008) Reachability computation for hybrid systems with Ariadne. In: Proceedings of the 17th IFAC World Congress

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanja Živanović Gonzalez .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Živanović Gonzalez, S., Collins, P. (2015). Computing Reachable Sets of Differential Inclusions. In: van Schuppen, J., Villa, T. (eds) Coordination Control of Distributed Systems. Lecture Notes in Control and Information Sciences, vol 456. Springer, Cham. https://doi.org/10.1007/978-3-319-10407-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10407-2_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10406-5

  • Online ISBN: 978-3-319-10407-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics