A Modula-2 implementation of CSP
- 1 June 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 22 (6) , 25-38
- https://doi.org/10.1145/24900.24902
Abstract
Recently, a series of process communication schemes based on message exchanges have been developed. Hoare's CSP is perhaps the most interesting one and is the base for concurrent features of modern languages (e.g. ADA, Occam, etc.).Several concurrency mechanisms have already been implemented in Modula-2 (signals, COBEGIN..COEND structure, message exchanges, etc.) but they have not completely fulfilled the Hoare's CSP scheme.In this paper a general implementation of CSP in Modula-2 is presented. Low level and modularity facilities of this language have been used to develop a kernel thus allowing the use of comunication primitives and nondeterministic selection.The original CSP scheme has been slightly modified by using port names instead of process names to specify communication.Keywords
This publication has 4 references indexed in Scilit:
- Modula-2 process facilitiesACM SIGPLAN Notices, 1984
- Programming in Modula-2Published by Springer Nature ,1982
- Communicating sequential processesCommunications of the ACM, 1978
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975