Skip to main content
Springer Nature Link
Log in

Hybrid Automata as Coalgebras

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2016 (ICTAC 2016)

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

Included in the following conference series:

  • 558 Accesses

Abstract

Able to simultaneously encode discrete transitions and continuous behaviour, hybrid automata are the de facto framework for the formal specification and analysis of hybrid systems. The current paper revisits hybrid automata from a coalgebraic point of view. This allows to interpret them as state-based components, and provides a uniform theory to address variability in their definition, as well as the corresponding notions of behaviour, bisimulation, and observational semantics.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    We restrict ourselves to the concepts strictly necessary to the paper. The interested reader will find in document [Rut00] a comprehensive introduction to the theory of coalgebras.

References

  1. Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.-H., Nicollin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theor. Comput. Sci. 138(1), 3–34 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R., Henzinger, T.A.: Modularity for timed and hybrid systems. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 74–88. Springer, Heidelberg (1997). doi:10.1007/3-540-63141-0_6

    Chapter  Google Scholar 

  3. Antoniotti, M., Mishra, B., Piazza, C., Policriti, A., Simeoni, M.: Modeling cellular behavior with hybrid automata: bisimulation and collapsing. In: Priami, C. (ed.) CMSB 2003. LNCS, vol. 2602, pp. 57–74. Springer, Heidelberg (2003)

    Google Scholar 

  4. Barbosa, L.S.: Towards a calculus of state-based software components. J. Univ. Comput. Sci. 9, 891–909 (2003)

    Google Scholar 

  5. Bartocci, E., Corradini, F., Di Berardini, M.R., Entcheva, E., Smolka, S.A., Grosu, R.: Modeling, simulation of cardiac tissue using hybrid i, o automata. Theor. Comput. Sci. 410(33–34), 3149–3165 (2009). Concurrent Systems Biology: To Nadia Busi (1968–2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Girard, A., Pappas, G.J.: Approximate bisimulation: a bridge between computer science and control theory. Eur. J. Control 17(5–6), 568–578 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Henzinger, T.A.: The theory of hybrid automata. In: Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278–292. IEEE Computer Society (1996)

    Google Scholar 

  8. Hasuo, I., Jacobs, B.: Traces for coalgebraic components. Math. Struct. Comput. Sci. 21(2), 267–320 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Haghverdi, E., Tabuada, P., Pappas, G.J.: Bisimulation relations for dynamical, control, and hybrid systems. Theor. Comput. Sci. 342(2–3), 229–261 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jacobs, B.: Object-oriented hybrid systems of coalgebras plus monoid actions. Theor. Comput. Sci. 239(1), 41–95 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jacobs, B.: Introduction to coalgebra. Towards mathematics of states and observations (2012)

    Google Scholar 

  12. Liu, J., Liu, X., Koo, T.-KJ., Sinopoli, B., Sastry, S., Lee, E.A.: A hierarchical hybrid system model and its simulation. In: 38th IEEE Decision and Control, vol. 4, pp. 3508–3513. IEEE (1999)

    Google Scholar 

  13. Nadjm-Tehrani, S.: Time-deterministic hybrid transition systems. In: Antsaklis, P., Lemmon, M., Kohn, W., Nerode, A., Sastry, S. (eds.) HS 1997. LNCS, vol. 1567, pp. 238–250. Springer, Heidelberg (1999). doi:10.1007/3-540-49163-5_13

    Chapter  Google Scholar 

  14. Neves, R., Barbosa, L.S.: Hybrid automata as coalgebras (extended version) (2016). http://alfa.di.uminho.pt/~nevrenato/pdfs/HAExtended.pdf

    Google Scholar 

  15. Neves, R., Barbosa, L.S., Hofmann, D., Martins, M.A.: Continuity as a computational effect. CoRR, abs/1507.03219 (2016). To appear in J. Logical Algebraic Methods Programm

    Google Scholar 

  16. Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3–80 (2000). Modern Algebra

    Article  MathSciNet  MATH  Google Scholar 

  17. Sokolova, A.: Coalgebraic analysis of probabilistic systems. Ph.D. thesis, Technische Universiteit Eindhoven (2005)

    Google Scholar 

  18. Sproston, J.: Decidable model checking of probabilistic hybrid automata. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 31–45. Springer, Heidelberg (2000). doi:10.1007/3-540-45352-0_5

    Chapter  Google Scholar 

  19. Szyperski, C.: Component Software. Beyond Object-Oriented Programming. Addison-Wesley, New York (1998)

    Google Scholar 

Download references

Acknowledgements

This work is funded by ERDF - European Regional Development Fund, through the COMPETE Programme, and by National Funds through FCT within project PTDC/EEI-CTP/4836/2014. The first author is also sponsored by FCT grant SFRH/BD/52234/2013, and the second by FCT grant SFRH/BSAB/113890/2015

Author information

Authors and Affiliations

  1. HASLab (INESC TEC) & Universidade do Minho, Braga, Portugal

    Renato Neves & Luis S. Barbosa

Authors
  1. Renato Neves
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis S. Barbosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Renato Neves .

Editor information

Editors and Affiliations

  1. Universidade Federal de Pernambuco Centro de Informática, Recife, Pernambuco, Brazil

    Augusto Sampaio

  2. Deptartment of Electrical Engineering BL, National Taiwan University, Taipei, Taiwan

    Farn Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Neves, R., Barbosa, L.S. (2016). Hybrid Automata as Coalgebras. In: Sampaio, A., Wang, F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science(), vol 9965. Springer, Cham. https://doi.org/10.1007/978-3-319-46750-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46750-4_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46749-8

  • Online ISBN: 978-3-319-46750-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics