Abstract
Process algebras like CSP provide a convenient intermediate-level formalism for the design of concurrent systems by allowing processes to be combined in parallel in such a way that the designer abstracts synchronization mechanisms and simultaneity of events. However some purposes require potential simultaneity to be made explicit. One approach is to produce new semantics models encapsulating that information. The approach taken here is to use the standard models and the CSP tool, FDR, to simulate a process in such a way to reveal potentially-simultaneous events. The simulation is achieved by a construction that splits events into start and end events and monitors the result in a manner faithful to the original process. The method is applied to determine pairs of possibly concurrent events and to compute maximal simultaneity in a CSP design.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fischer, C.: CSP-OZ: A combination of Object-Z and CSP. In: FMOODS 1997: International Workshop on Formal Methods for Open Object-Based Distributed Systems, pp. 423–438. Chapman and Hall, Boca Raton (1997)
Gardner, W.B.: Bridging CSP and C++ with Selective Formalism and Executable Specifications. In: MEMOCODE 2003: International Conference on Formal Methods and Models for Co-Design, pp. 237–245. IEEE Computer Society, Los Alamitos (2003)
Goldsmith, M., Roscoe, B., Armstrong, P.: Failures-Divergence Refinement - FDR2 User Manual (2005), http://www.fsel.com/fdr2_manual.html
Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International, Englewood Cliffs (1985)
Isobe, Y., Roggenbach, M.: A Generic Theorem Prover of CSP Refinement. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 108–123. Springer, Heidelberg (2005)
Kleine, M., Sanders, J.W.: Simulating truly concurrent CSP. Technical Report 434, UNU-IIST, P.O. Box 3058, Macau (June 2010)
Kwiatkowska, M., Phillips, I.: Possible and Guaranteed Concurrency in CSP. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 220–235. Springer, Heidelberg (1995)
Leuschel, M., Fontaine, M.: Probing the Depths of CSP-M: A new FDR-compliant Validation Tool. In: Liu, S., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 278–297. Springer, Heidelberg (2008)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (2005)
Scattergood, B.: The Semantics and Implementation of Machine-readable CSP. PhD thesis, University of Oxford (1998)
Sun, J., Liu, Y., Dong, J.S.: Model Checking CSP Revisited: Introducing a Process Analysis Toolkit. In: Cuellar, J., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 307–322. Springer, Heidelberg (2008)
Taubner, D., Vogler, W.: Step failures semantics and a complete proof system. Acta Inf. 27(2), 125–156 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kleine, M., Sanders, J.W. (2011). Simulating Truly Concurrent CSP. In: Davies, J., Silva, L., Simao, A. (eds) Formal Methods: Foundations and Applications. SBMF 2010. Lecture Notes in Computer Science, vol 6527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19829-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-19829-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19828-1
Online ISBN: 978-3-642-19829-8
eBook Packages: Computer ScienceComputer Science (R0)