Abstract
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.
Keywords
- 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
Brooke, P.J.: A Timed Semantics for a Hierarchical Design Notation. PhD thesis, University of York (April 1999)
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)
Davies, J.: Specification and Proof in Real-Time CSP. Cambridge University Press, Cambridge (1993)
Formal Systems (Europe) Ltd. Failure Divergence Refinement: FDR2 User Manual (1997)
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)
Hoare, C.A.R.: Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)
Santosa, A., Jaffar, J., Voicu, R.: Modeling Systems in CLP with Coinductive Tabling. In: International Conference on Logic Programming (2005)
Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. Journal of Logic Programming 19, 20, 503–581 (1994)
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)
Jaffar, J., Santosa, A.E., Voicu, R.: A CLP Proof Method for Timed Automata. In: Real-Time Systems Symposium, pp. 175–186 (2004)
Mahony, B.P., Dong, J.S.: Timed Communicating Object Z. IEEE Trans. Software Eng. 26(2), 150–177 (2000)
Milner, R.: A Calculus of Communicating Systems, vol. 92. Springer, Heidelberg (1980)
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)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997)
Schneider, S.: Concurrent and Real-time System: The CSP Approach. John Wiley & Sons, Ltd, Chichester (2000)
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)
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)
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)
Woodcock, J., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice-Hall International, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, J.S., Hao, P., Sun, J., Zhang, X. (2006). A Reasoning Method for Timed CSP Based on Constraint Solving. In: Liu, Z., He, J. (eds) Formal Methods and Software Engineering. ICFEM 2006. Lecture Notes in Computer Science, vol 4260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11901433_19
Download citation
DOI: https://doi.org/10.1007/11901433_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47460-9
Online ISBN: 978-3-540-47462-3
eBook Packages: Computer ScienceComputer Science (R0)