Skip to main content
Log in

Finite abstractions for hybrid systems with stable continuous dynamics

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

This paper outlines an abstraction process in which a particular class of hybrid automata with continuous dynamics that have parameterized positive limit sets, are being abstracted into finite transition systems. The limit sets with their corresponding attraction regions define pre- and post-conditions for the continuous dynamics, and determine the transitions in the discrete abstraction. An observable (weak) bisimulation equivalence is established between the two models. The abstraction process described can find application in verification, as well as in planning and symbolic control.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Notes

  1. The region of attraction of a particular component \(L^+_b\) of the positive limit set L  +  of the flow of vector field f in X can be defined as (Athanasopoulos 2003) \( \mathcal A^+_b( X) \triangleq \{ x\in X \mid \lim_{t\to\infty}\) \(\ensuremath{\mathrm{dist} \big(\Phi_t(x),L^+_b\big)} = 0\}\).

  2. This is in fact a semi-automaton, since there is no specification for initial and final states.

  3. Alternatively, we can define \(\mathfrak R\) as an equivalence relation in \(\mathcal{H}\) by identifying it with the map \(V_{{\kern-1.75pt}M}^{-1} \circ V_{{\kern-1.75pt}M} (\cdot, s(\cdot))\).

  4. These type of transitions in H correspond to an on-line re-parameterization of the controller already activated.

  5. The set S n denotes the surface of an n-dimensional sphere.

  6. We assume that the user is not right next to the printer and so \(q_u \notin \mathcal{W}(p_n)\), because then there would be no need to send the robot to bring the printout.

References

  • Alur R, Henzinger T, Lafferriere G, Pappas G (2000) Discrete abstractions of hybrid systems. Proc IEEE 88(7):971–984

    Article  Google Scholar 

  • Alur R, Verimag TD, Ivancic F (2006) Predicate abstractions for reachability analysis of hybrid systems. ACM Trans Embed Comput Syst 5(1):152–199

    Article  Google Scholar 

  • Athanasopoulos K (2003) Explosions near isolated unstable attractors. Pac J Math 210(2):201–214

    Article  Google Scholar 

  • Broucke ME (1999) A geometric approach to bisimulation and verification of hybrid systems. In: Vaandrager FW, van Schuppen JH (eds) Hybrid systems: computation and control. Lecture notes in computer science, vol 1569. Springer-Verlag, pp 61–75

  • Bullo F, Lewis AD (2005) Geometric control of mechanical systems. No. 49 in Texts in Applied Mathematics. Springer

  • Girard A, Cuernic C (2008) Zonotope/hyperplane intersection for bybrid systems reachability analysis. In: Egerstedt M, Mishra P (eds) hybrid systems: computation and control, LNCS, vol 4981. Springer-Verlag, pp 215–228

  • Girard A, Pappas GJ (2007) Approximate metrics for discrete and continuous systems. IEEE Trans Automat Contr 53(5):782–798

    Article  MathSciNet  Google Scholar 

  • Girard A, Pappas GJ (2009) Hierarchical control system design using approximate simulation. Automatica 45:566–571

    Article  MathSciNet  MATH  Google Scholar 

  • Girard A, Pola G, Tabuada P (2008) Approximately bisimilar symbolic models for incrementally stable switched systems. In: Egerstedt M, Mishra B (eds) Hybrid systems: computation and control. Lecture notes in computer science, vol 4981. Springer Verlag, pp 201–214

  • Gulwani S, Tiwari A (2008) Constraint-based approach for analysis of hybrid systems. In: Gupta A, Malik S (eds) Computer aided verification, LNCS, vol 5123. Springer-Verlag, pp 190–203

  • Khalil HK (1996) Nonlinear systems. Prentice Hall

  • Koutsoukos X, Antsaklis P, Stiver J, Lemmon M (2000) Supervisory control of hybrid systems. Proc IEEE 88(7):1026–1049

    Article  Google Scholar 

  • Kowalewski S, Engell S, Preußig J, Stursberg O (1999) Verification of logic controlles for continuous plants using timed condition/event-system models. Automatica 35:505–518

    Article  Google Scholar 

  • Kurzhanski A, Varaiya P (2000) Ellipsoidal techniques for reachability analysis. In: Lynch N, Krogh B (eds) Hybrid systems: computation and control, LNCS, vol 1790. Springer-Verlag, pp 310–323

  • Lerda F, Kapinski J, Clarke E, Krogh B (2008) Verification of supervisory control software using state proximity and merging. In: Egerstedt M, Mishra B (eds) Hybrid systems: computation and control, LNCS, vol 4981. Springer-Verlag, pp 344–357

  • Lunze J, Nixdorf B, Schroder J (1999) Deterministic discrete-event representations of linear continuous-variable systems. Automatica 35(3):395–406

    Article  MathSciNet  MATH  Google Scholar 

  • Lygeros J, Johansson K, Simić S, Sastry S (2003) Dynamical properties of hybrid automata. IEEE Trans Automat Contr 48(1):2–17

    Article  Google Scholar 

  • Milner R (1989) Communication and concurrency. Prentice Hall

  • Milner R (2003) Communicating and mobile systems: the π calculus. Cambridge University Press

  • Piovesan JL, Tanner HG, Abdallah CT (2006) Discrete asymptotic abstractions of hybrid systems. In: Proceedings of 45th IEEE conference on decision & control, pp 917–922

  • Platzer A, Clarke EM (2009) Computing differential invariants of hybrid systems as fixedpoints. Form Methods Syst Des 35(1):98–120

    Article  MATH  Google Scholar 

  • Raisch J, O’Young S (1998) Discrete approximations and supervisory control of continuous systems. IEEE Trans Automat Contr 43(4):569–573

    Article  MathSciNet  MATH  Google Scholar 

  • Stirling C (1996) Modal and temporal logics for processes. In: Moller F, Birtwistle G (eds) Logics for concurency: structure vs automata. Springer

  • Stursberg O, Krogh B (2003) Efficient representation and computation of reachable sets for hybrid systems. In: Lynch O, Pnueli A (eds) Hybrid systems: computation and control, LNCS, vol 2623. Springer-Verlag, pp 482–497

  • Tabuada P (2007) Approximate simulation relations and finite abstractions of quantized control systems. In: Bemporad A, Bicchi A, Buttazzo G (eds) Hybrid systems: computation and control. Lecture notes in computer science, vol 4416. Springer-Verlag, pp 529–542

  • Tazaki Y, Imura J (2008) Finite abstractions of discrete-time linear systems and its application to optimal control. In: Proceedings of the 17th IFAC World Congress, pp 4656–4661

  • Tiwari A (2008) Abstractions for hybrid systems. Form Methods Syst Des 32(1):57–83

    Article  MATH  Google Scholar 

  • Tomlin C, Mitchell I, Bayen A, Oishi M (2000) Computational techniques for the verification of hybrid systems. Proc IEEE 91(7):986–1001

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Herbert G. Tanner.

Additional information

The work of the first author is supported by the National Science Foundation under grant # 0447898. The work of the other authors was also supported by the National Science Foundation (CNS0626380) under the FIND initiative.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tanner, H.G., Fu, J., Rawal, C. et al. Finite abstractions for hybrid systems with stable continuous dynamics. Discrete Event Dyn Syst 22, 83–99 (2012). https://doi.org/10.1007/s10626-011-0119-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-011-0119-6

Keywords

Navigation