Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Systems: Computation and Control

HSCC 2002: Hybrid Systems: Computation and Control pp 436–450Cite as

Composing Abstractions of Hybrid Systems

  • Conference paper
  • First Online:

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

Abstract

The analysis and design of hybrid systems must exploit their hierarchical and compositional nature of in order to tackle complexity. In previous work, we presented a hierarchical abstraction framework for hybrid control systems based on the notions of simulation and bisimulation. In this paper, we build upon our previous work and investigate the compositionality of our abstraction framework. We present a composition operator that allows synchronization on inputs and states of hybrid systems. We then show that the composition operator is compatible with our abstraction framework in the sense that abstracting subsystems will the result in an abstraction of the overall system.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In Proceedings f the 9th International Conference on Concurency Theory, volume 1243 of Lecture Notes in Computer Science, pages 74–88. Springer-Verlag, 1997.

    Google Scholar 

  2. Rajeev Alur, Radu Grosu, Insup Lee, and Oleg Sokolsky. Compositional refinements for hierarchical hybrid systems. In Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Science, pages 33–48. Springer Verlag, 2001.

    Chapter  Google Scholar 

  3. T.A. Henzinger. The theory of hybrid automata. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pages 278–292. IEEE Computer Society Press, 1996.

    Google Scholar 

  4. Thomas A. Henzinger, Marius Minea, and Vinayak Prabhu. Assume-guarantee reasoning for hierarchical hybrid systems. In Hybrid Systems: Computationand Control, volume 2034 of Lecture Notes in Computer Science, pages 275–290. Springer Verlag, 2001.

    Chapter  Google Scholar 

  5. John E. Hopcroft and Jeffery D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, USA, 1979.

    MATH  Google Scholar 

  6. Karl Henrick Johansson, Magnus Egersted, John Lygeros, and S. Sastry. On the regularization of hybrid automata. Systems and Control Letters, 38:141–150, 1999.

    Article  MathSciNet  Google Scholar 

  7. E.A. Lee and A. Sangiovanni-Vincentelli. A framework for comparing models of computation. IEEE Transactions on Computer Aided Design, 17(12), December 1998.

    Google Scholar 

  8. Nancy Lynch, Roberto Segala, and Frits Vaandrager. Hybrid I/O automata revisited. In Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Science, pages 403–417. Springer Verlag, 2001.

    Chapter  Google Scholar 

  9. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer Verlag, New York, 1995.

    Google Scholar 

  10. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  11. George J. Pappas, Gerardo Lafferriere, and Shankar Sastry. Hierarchically consistent control systems. IEEE Transactions on Automatic Control, 45(6):1144–1160, June 2000.

    Article  MATH  MathSciNet  Google Scholar 

  12. George J. Pappas and Slobodan Simic. Consistent hierarchies of afine nonlinear systems. IEEE Transactions on Automatic Control, 2001. To appear.

    Google Scholar 

  13. Markus Roggenbach and Mila Majster-Cederbaum. Towards a unified view of bisimulation: a comparative study. Theoretical Computer Science, (238):81–130, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  14. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Theoretical Computer Science, 249(1):3–80, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  15. Paulo Tabuada. Hierarchies and Compositional Abstractions of Hybrid Systems. PhD thesis, Instituto Superior T’ecnico, Lisbon, Portugal, January 2002.

    Google Scholar 

  16. Paulo Tabuada and George J. Pappas. Hybrid abstractions that preserve timedlanguages. In Hybrid Systems: Computation and Control, volume 2034 of Lecture Notes in Computer Science, pages 501–514. Springer Verlag, 2001.

    Chapter  Google Scholar 

  17. Paulo Tabuada, George J. Pappas, and Pedro Lima. Compositional abstractions of hybrid control systems. In Proceedings of the 40th IEEE Conference on Decision and Control, December 2001.

    Google Scholar 

  18. A. J. van der Schaft and J. M. Schumacher. Compositionality issues in discrete, continuous, and hybrid systems. International Journal of Robust and Nonlinear Control, 11(5):417–434, April 2001.

    Article  MATH  MathSciNet  Google Scholar 

  19. Glynn Winskel and Mogens Nielsen. Models for concurrency. In Abramsky, Gabbay, and Maibaum, editors, Handbook of Logic and Foundations of Theoretical Computer Science, volume 4. Oxford University Press, London, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Pennsylvania, 19104, Philadelphia, PA

    Paulo Tabuada & George J. Pappas

  2. Instituto de Sistemas e Robótica, Instituto Superior Técnico, 1049-001, Lisboa, Portugal

    Pedro Lima

Authors
  1. Paulo Tabuada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George J. Pappas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro Lima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Aeronautics and Astronautics, Stanford University, 250 Durand Building MC4035, 94305-4035, Stanford, CA, USA

    Claire J. Tomlin

  2. Department of Computer Science, University of British Columbia, 201-2366 Main Mall, V6T1Z4, Vancouver BC, Canada

    Mark R. Greenstreet

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tabuada, P., Pappas, G.J., Lima, P. (2002). Composing Abstractions of Hybrid Systems. In: Tomlin, C.J., Greenstreet, M.R. (eds) Hybrid Systems: Computation and Control. HSCC 2002. Lecture Notes in Computer Science, vol 2289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45873-5_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45873-5_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43321-7

  • Online ISBN: 978-3-540-45873-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation