Skip to main content
SpringerLink
Log in

An Assume/Guarantee Based Compositional Calculus for Hybrid CSP

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2012)

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

Abstract

Hybrid CSP (HCSP) extends CSP to describe interacting continuous and discrete dynamics. The concurrency with synchronous communications, timing constructs, interrupts, differential equations, and so on, make the behavior of HCSP difficult to specify and verify. In this paper, we propose a Hoare style calculus for reasoning about HCSP. The calculus includes Duration Calculus formulas to record process execution history and reason about real-time properties and continuous evolution, and dedicated predicate symbols to specify communication traces and readiness of process actions so that the composite constructs of HCSP can be handled compositionally by using assume/guarantee reasoning.

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. Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.: Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 209–229. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  2. Guelev, D.P., Dang, V.H.: Prefix and projection onto state in duration calculus. In: ETAPS Workshop Theory and Practice of Timed Systems (TPTS 2002). ENTCS, vol. 65(6), pp. 101–119 (2002)

    Google Scholar 

  3. Guelev, D.P., Dang, V.H.: On the completeness and decidability of duration calculus with iteration. Theoretical Computer Science 337(1-3), 278–304 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. He, J.: From CSP to hybrid systems. In: A Classical Mind, pp. 171–189. Prentice Hall International (UK) Ltd. (1994)

    Google Scholar 

  5. Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996, pp. 278–292. IEEE Computer Society (1996)

    Google Scholar 

  6. Hoare, C.A.R.: A calculus of total correctness for communicating processes. Science of Computer Programming 1(1-2), 49–72 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hooman, J.: Extending Hoare logic to real-time. Formal Aspects of Computing 6(6A), 801–826 (1994)

    Article  MATH  Google Scholar 

  8. Liu, J., Lv, J., Quan, Z., Zhan, N., Zhao, H., Zhou, C., Zou, L.: A Calculus for Hybrid CSP. In: Ueda, K. (ed.) APLAS 2010. LNCS, vol. 6461, pp. 1–15. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Liu, J., Zhan, N., Zhao, H.: Computing semi-algebraic invariants for polynomial dynamical systems. In: EMSOFT 2011, pp. 97–106. ACM (2011)

    Google Scholar 

  10. Manna, Z., Pnueli, A.: Verifying Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 4–35. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  11. Manna, Z., Sipma, H.: Deductive Verification of Hybrid Systems Using STeP. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 305–318. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Misra, J., Chandy, M.: Proofs of networks of processes. IEEE Transactions on Software Engineering (TSE) 7(4), 417–426 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pandya, P.K., Joseph, M.: P-A logic - a compositional proof system for distributed programs. Distributed Computing 5, 37–54 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  14. Platzer, A.: Differential dynamic logic for hybrid systems. Journal of Automated Reasoning 41(2), 143–189 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Soundararajan, N.: Axiomatic semantics of communicating sequential processes. ACM Transactions on Programming Languages and Systems 6(4), 647–662 (1984)

    Article  MATH  Google Scholar 

  16. Wang, S., Zhan, N., Guelev, D.: An assume/guarantee based compositional calculus for hybrid CSP and its soundness. Technical Report ISCAS-SKLCS-11-24, State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences (2011)

    Google Scholar 

  17. Zhou, C.: Specifying Communicating Systems with Temporal Logic. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol. 398, pp. 304–323. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  18. Zhou, C., Dang, V., Li, X.: A Duration Calculus with Infinite Intervals. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 16–41. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  19. Zhou, C., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. Series: Monographs in Theoretical Computer Science. An EATCS Series. Springer (2004)

    Google Scholar 

  20. Zhou, C., Wang, J., Ravn, A.P.: A Formal Description of Hybrid Systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 511–530. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  21. Zwiers, J., de Bruin, A., de Roever, W.-P.: A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract). In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 513–527. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Lab. of Comput. Sci., Institute of Software, Chinese Academy of Sciences, China

    Shuling Wang & Naijun Zhan

  2. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria

    Dimitar Guelev

Authors
  1. Shuling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Naijun Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dimitar Guelev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Resource Planning and Generation, Indian Institute of Technology Kanpur, 208016, Kanpur, India

    Manindra Agrawal

  2. Department of Pure Mathematics, Leeds, University of Leeds, LS2 9JT, UK

    S. Barry Cooper

  3. Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, 100190, Beijing, P.R. China

    Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, S., Zhan, N., Guelev, D. (2012). An Assume/Guarantee Based Compositional Calculus for Hybrid CSP. In: Agrawal, M., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2012. Lecture Notes in Computer Science, vol 7287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29952-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29952-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29951-3

  • Online ISBN: 978-3-642-29952-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation