Skip to main content
SpringerLink
Log in

Rigorous Discretization of Hybrid Systems Using Process Calculi

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2011)

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

  • 591 Accesses

Abstract

In the context of a hybrid process calculus, we present a formal discretization procedure that abstracts a class of hybrid systems to simply timed systems while preserving observational congruence. The resulting term is not completely discrete because the temporal synchronization between concurrent hybrid processes needs to be maintained. In this paper, we (i) define the hybrid process calculus HCCS as a suitable minimalistic extension of CCS [18] , (ii) study its metatheory including an important connection between behavioural congruence and zenoness, (iii) state and prove properties that are required for a rigorous analysis of discretization, and (iv) apply our methodology to prove a hybrid tank system correct.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M., Thiagarajan, P.S.: The discrete time behavior of lazy linear hybrid automata. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 55–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  3. Baeten, J.C.M., van Beek, D.A., Cuijpers, P.J.L., et al.: Model-based engineering of embedded systems using the hybrid process algebra χ. ENTCS 209, 21–53 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Beohar, H., Cuijpers, P.J.L., Baeten, J.C.M.: Design of asynchronous supervisors. CoRR, abs/0910.0868 (2009)

    Google Scholar 

  5. Bergstra, J.A., Middelburg, C.A.: Process algebra for hybrid systems. Theor. Comput. Sci. 335(2-3), 215–280 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brinksma, E., Krilavičius, T.: Behavioural hybrid process calculus. TR-CTIT-05.45, CTIT, University of Twente (2005)

    Google Scholar 

  7. Cleaveland, R., Lüttgen, G., Natarajan, V.: Handbook of Process Algebra. Ch.12. Elsevier Science Inc., Amsterdam (2001)

    MATH  Google Scholar 

  8. Cuijpers, P.J.L.: Hybrid Process Algebra. PhD thesis (2004)

    Google Scholar 

  9. Cuijpers, P.J.L., Reniers, M.A.: Topological (bi-)simulation. ENTCS 100, 49–64 (2004)

    MATH  Google Scholar 

  10. Cuijpers, P.J.L., Reniers, M.A., Heemels, W.P.M.H.: Hybrid transition systems. TR, Department of Computer Science, TU/e (2002)

    Google Scholar 

  11. Davoren, J.M., Moor, T., Nerode, A.: Hybrid control loops, a/d maps, and dynamic specifications. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 149–163. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Fränzle, M., Herde, C.: Hysat: An efficient proof engine for bounded model checking of hybrid systems. FMSD 30(3), 179–198 (2007)

    MATH  Google Scholar 

  13. Galpin, V., Bortolussi, L., Hillston, J.: Hype: A process algebra for compositional flows and emergent behaviour. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 305–320. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Henzinger, T.A.: Verification of digital and hybrid systems. NATO ASI Series F 170, 265–292 (2000)

    Google Scholar 

  15. Henzinger, T.A., Ho, P., Wong-Toi, H.: Hytech: A model checker for hybrid systems. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 460–463. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  16. Henzinger, T.A., Horowitz, B., Majumdar, R., Wong-Toi, H.: Beyond hytech: Hybrid systems analysis using interval numerical methods. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 130–144. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Lynch, N.A., Segala, R., Vaandrager, F.W.: Hybrid I/O automata. Inf. Comput. 185(1), 105–157 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Englewood Cliffs (1989)

    MATH  Google Scholar 

  19. Moor, T., Raisch, J., O’Young, S.: Discrete supervisory control of hybrid systems based on l-complete approximations. DEDS 12(1), 83–107 (2002)

    MathSciNet  MATH  Google Scholar 

  20. Platzer, A.: Differential dynamic logic for hybrid systems. J. Autom. Reasoning 41(2), 143–189 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  21. Puri, A., Varaiya, P.: Verification of hybrid systems using abstractions. In: Antsaklis, P.J., Kohn, W., Nerode, A., Sastry, S.S. (eds.) HS 1994. LNCS, vol. 999, pp. 359–369. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  22. Raisch, J., Moor, T.: Hierarchical Hybrid Control of a Multiproduct Batch Plant. LNCIS, vol. 322, pp. 99–216. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  23. Rounds, W.C.: A spatial logic for the hybrid π-calculus. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 508–522. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  24. Stauner, T.: Discrete-time refinement of hybrid automata. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 407–420. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  25. Tiwari, A.: Abstractions for hybrid systems. FMSD 32(1), 57–83 (2008)

    MATH  Google Scholar 

  26. van Beek, D.A., Reniers, M.A., Schiffelers, R.R.H., et al.: Foundations of a compositional interchange format for hybrid systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 587–600. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  27. De Wulf, M., Doyen, L., Raskin, J.: Almost asap semantics: from timed models to timed implementations. Formal Asp. Comput. 17(3), 319–341 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Berlin, Germany

    Sven Schneider & Uwe Nestmann

Authors
  1. Sven Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Nestmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRISA/INRIA Rennes, Campus Beaulieu, 35042, Rennes Cedex, France

    Uli Fahrenberg

  2. University of California, 94720-1770, Berkeley, CA, USA

    Stavros Tripakis

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, S., Nestmann, U. (2011). Rigorous Discretization of Hybrid Systems Using Process Calculi. In: Fahrenberg, U., Tripakis, S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2011. Lecture Notes in Computer Science, vol 6919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24310-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24310-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24309-7

  • Online ISBN: 978-3-642-24310-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation