A Reasoning Method for Timed CSP Based on Constraint Solving

  • Jin Song Dong
  • Ping Hao
  • Jun Sun
  • Xian Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4260)


Timed CSP extends CSP by introducing a capability to quantify temporal aspects of sequencing and synchronization. It is a powerful language to model real time reactive systems. However, there is no verification tool support for proving critical properties over systems modelled using Timed CSP. In this work, we construct a reasoning method using Constraint Logic Programming (CLP) as an underlying reasoning mechanism for Timed CSP. We start with encoding the semantics of Timed CSP in CLP, which allows a systematic translation of Timed CSP to CLP. Powerful constraint solver like CLP(\(\mathcal{R}\)) is then used to prove traditional safety properties and beyond, e.g., reachability, deadlock-freeness, timewise refinement relationship, lower or upper bound of a time interval, etc. Counter-examples are generated when properties are not satisfied. Moreover, our method also handles useful extensions to Timed CSP. Finally, we demonstrate the effectiveness of our approach through case study of standard real time systems.


Operational Semantic Process Expression Liveness Property Communicate Sequential Process Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abhik, R., Ramakrishnan, I.V.: Automated Inductive Verification of Parameterized Protocols. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 25. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    Brooke, P.J.: A Timed Semantics for a Hierarchical Design Notation. PhD thesis, University of York (April 1999)Google Scholar
  3. 3.
    Chaki, S., Clarke, E.M., Ouaknine, J., Sharygina, N., Sinha, N.: State/Event-based Software Model Checking. In: Proceeding of Integrate Formal Methods 2004, pp. 128–147 (2004)Google Scholar
  4. 4.
    Davies, J.: Specification and Proof in Real-Time CSP. Cambridge University Press, Cambridge (1993)zbMATHCrossRefGoogle Scholar
  5. 5.
    Formal Systems (Europe) Ltd. Failure Divergence Refinement: FDR2 User Manual (1997)Google Scholar
  6. 6.
    Gupta, G.l., Pontelli, E.: A Constraint-based Approach for Specification and Verification of Real-time Systems. In: IEEE Real-Time Systems Symposium, pp. 230–239 (1997)Google Scholar
  7. 7.
    Hoare, C.A.R.: Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  8. 8.
    Santosa, A., Jaffar, J., Voicu, R.: Modeling Systems in CLP with Coinductive Tabling. In: International Conference on Logic Programming (2005)Google Scholar
  9. 9.
    Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming 19, 20, 503–581 (1994)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Jaffar, J., Michaylov, S., Stuckey, P.J., Yap, R.H.C.: The CLP(R) Language and System. ACM Trans. Program. Lang. Syst. 14(3), 339–395 (1992)CrossRefGoogle Scholar
  11. 11.
    Jaffar, J., Santosa, A.E., Voicu, R.: A CLP Proof Method for Timed Automata. In: Real-Time Systems Symposium, pp. 175–186 (2004)Google Scholar
  12. 12.
    Mahony, B.P., Dong, J.S.: Timed Communicating Object Z. IEEE Trans. Software Eng. 26(2), 150–177 (2000)CrossRefGoogle Scholar
  13. 13.
    Milner, R.: A Calculus of Communicating Systems, vol. 92. Springer, Heidelberg (1980)zbMATHGoogle Scholar
  14. 14.
    Reed, G.M., Roscoe, A.W.: A Timed Model for Communicating Sequential Processes. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 314–323. Springer, Heidelberg (1986)Google Scholar
  15. 15.
    Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)Google Scholar
  16. 16.
    Schneider, S.: Concurrent and Real-time System: The CSP Approach. John Wiley & Sons, Ltd, Chichester (2000)Google Scholar
  17. 17.
    Schneider, S.A.: An Operational Semantics for Timed CSP. In: Proceedings Chalmers Workshop on Concurrency, pp. 428–456 (1991); Report PMG-R63, Chalmers University of Technology and University of Göteborg (1992)Google Scholar
  18. 18.
    Smith, G., Derrick, J.: Specification, Refinement and Verification of Concurrent Systems-An Integration of Object-Z and CSP. Formal Methods in System Design 18(3), 249–284 (2001)zbMATHCrossRefGoogle Scholar
  19. 19.
    Warren, D.S.: Programming with Tabling in XSB. In: PROCOMET 1998: Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods, pp. 5–6, London, UK (1998)Google Scholar
  20. 20.
    Woodcock, J., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice-Hall International, Englewood Cliffs (1996)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jin Song Dong
    • 1
  • Ping Hao
    • 1
  • Jun Sun
    • 1
  • Xian Zhang
    • 1
  1. 1.School of ComputingNational University of Singapore 

Personalised recommendations