Skip to main content

Super-Dense Computation in Verification of Hybrid CSP Processes

  • Conference paper
  • First Online:
Formal Aspects of Component Software (FACS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8348))

Included in the following conference series:

Abstract

Hybrid Communicating Sequential Processes (HCSP) extends CSP to include differential equations and interruptions. We feel comfortable in our experience with HCSP to model scenarios of the Level 3 of Chinese Train Control System (CTCS-3), and to define a formal semantics for Simulink. The Hoare style calculus of [5] proposes a calculus to verify HCSP processes. However it has an error with respect to super-dense computation. This paper is to establish another calculus for a subset of HCSP, which uses Duration Calculus formulas to record program history, negligible time state to denote super-dense computation and semantic continuation to avoid infinite interval. It is compositional and sound.

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

Access this chapter

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 EPUB and 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

References

  1. Guelev, D.P., Van Hung, D.: Prefix and projection onto state in duration calculus. In: Proceedings of TPTS’02, volume 65(6) of ENTCS, pp. 101–119. Elsevier Science (2002)

    Google Scholar 

  2. Guelev, D.P., Wang, S., Zhan, N.: Hoare-style reasoning about hybrid CSP in the duration calculus. Technical report ISCAS-SKLCS-13-01, ISCAS (2013)

    Google Scholar 

  3. He, J.: From CSP to hybrid systems. In: Roscoe, A.W. (ed.) Proceedings of a Classical Mind: Essays in Honour of C. A. R. Hoare. Prentice-Hall International Series in Computer, pp. 171–189. Prentice-Hall, New Jersey (1994)

    Google Scholar 

  4. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, New Jersey (1985)

    MATH  Google Scholar 

  5. 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 

  6. Liu, J., Zhan, N., Zhao, H.: Computing semi-algebraic invariants for polynomial dynamical systems. In: Proceedings of EMSoft’11, pp. 97–106 (2011)

    Google Scholar 

  7. Pandya, P.K., Van Hung, D.: Duration calculus of weakly monotonic time. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 55–64. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Platzer, A., Clarke, E.M.: Computing differential invariants of hybrid systems as fixedpoints. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 176–189. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Platzer, A., Quesel, J.-D.: European train control system: a case study in formal verification. In: Proceedings of ICFEM ’09, pp. 246–265 (2009)

    Google Scholar 

  10. Xia, B., Yang, L.: An algorithm for isolating the real solutions of semi-algebraic systems. J. Symbolic Comput. 34, 461–477 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Yang, L.: Recent advances on determining the number of real roots of parametric polynomials. J. Symbolic Comput. 28, 225–242 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Zhan, N., Wang, S., Zhao, H.: Formal modelling, analysis and verification of hybrid systems. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Unifying Theories of Programming and Formal Engineering Methods. LNCS, vol. 8050, pp. 207–281. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  13. Zhou, C., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. Springer, Heidelberg (2004)

    Google Scholar 

  14. Zhou, C., Wang, J., Ravn, A.P.: A formal description of hybrid systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) Hybrid Systems III. LNCS, pp. 511–530. Springer, Heidelberg (1995)

    Google Scholar 

  15. Zou, L., Lv, J., Wang, S., Zhan, N., Tang, T., Yuan, L., Liu, Y.: Verifying Chinese train control system under a combined scenario by theorem proving. In: Cohen, E., Rybalchenko, A. (eds.) VSTTE 2013. LNCS, vol. 8164, pp. 262–280. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  16. Zou, L., Zhan, N., Wang, S., Fränzle, M., Qin, S.: Verifying simulink diagrams via a hybrid Hoare logic prover. In: Proceedings of EMSoft’13, pp. 1–10 (2013)

    Google Scholar 

Download references

Acknowledgment

This work has been partly supported by the 973 project with grant No. 2014CB340-700, and the projects from NSFC with grant No. 91118007 and 6110006.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shuling Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Guelev, D.P., Wang, S., Zhan, N., Zhou, C. (2014). Super-Dense Computation in Verification of Hybrid CSP Processes. In: Fiadeiro, J., Liu, Z., Xue, J. (eds) Formal Aspects of Component Software. FACS 2013. Lecture Notes in Computer Science(), vol 8348. Springer, Cham. https://doi.org/10.1007/978-3-319-07602-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07602-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07601-0

  • Online ISBN: 978-3-319-07602-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics