A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)

Volumn 31, Issue 3, 1984, Pages 560-599

  Brookes, S D ^a   Hoare, C A R ^b   Roscoe, A W ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

asynchrony; Communicating sequential processes; deadlock; nondeterminism; parallehsm; synchrony

Indexed keywords

COMPUTER METATHEORY; MATHEMATICAL MODELS;

COMMUNICATING SEQUENTIAL PROCESSES; DEADLOCK; NONDETERMINISM; PARALLELISM;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0021465083     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/828.833     Document Type: Article

References (29)

1. APT, K.R., FRANCEZ, N., AND DE ROEVER, W.P. A proof system for communicating sequential processes. ACM Trans. Program Lang. Syst. 2, 3 (July 1980), 359-385.
2. BROOKES, S.D. A model for commumcating sequential processes. D.Phil. dissertation, Oxford Univ., Oxford, England, 1983.
3. BROOKES, S.D. On the relationship of CCS and CSP. In Proceedings of the 1983 Internatwnal Conference on Automata, Languages, and Programming (ICALP 83) Lecture Notes in Computer Science, vol, 154. Springer-Verlag, New York, 1983.
4. BROOKES, S.D. A semantics and proof system for communicating proceses. In Proceedings of the NSF/ONR Conference on Logics of Programs. Lecture Notes in Computer Science, vol. 164. Springer-Verlag, New York, 1983.
5. BROOKES, S.D., AND ROSCOE, A.W. An improved failures model for communicating processes, to be published as CMU Tech. Rep., 1984.
6. CHANDY, R.M., AND MISRA, J. An axiomatic proof techmque for networks of communicating processes. Tech. Report TR-98, Univ. of Texas, Austin, Tex.
7. DOKSTRA, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed. Academic Press, New York, 1968.
8. FRANCEZ, N., LEaMANN, D., AND PNEOU, A. A linear history semantics of languages for distributed programming. In Proceedings of the 21st IEEE Foundations of Computer Science Symposmm IEEE, New York, 1980.
9. HENNESSY, M., AND MILNER, R. On observing nondeterminism and concurrency. In Proceedings of the 1980 lnternatwnal Conference on Automata, Languages, and Programming (ICALP 80). Lecture Notes in Computer Science, vol. 85. Springer-Verlag, New York, 1980.
10. HENNESSY, M., ANO DE NICOLA, R. Testing equivalences for processes. In Proceedings of the 1983 Internatwnal Conference on Automata, Languages, and Programming (ICALP 83). Lecture Notes in Computer Science, vol. 154. Springer-Verlag, New York, 1983.
11. HENNESSY, M., AND PLOTKIN, G. A term model for CCS. In Proceedings of the 9th Conference on Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol. 88 Springer-Verlag, New York, 1980.
12. HOARE, C.A.R. Communicating sequentml processes. Commun ACM 21, 8 (Aug. 1978), 666-676.
13. HOARE, C.A.R. A model for commumcating sequential processes. Teeh. Report PRG-22, Oxford Univ. Programming Research Group, Oxford, England, 1981.
14. HOARE, C.A.R., BROOKES, S.D., AND ROSCOE, A.W. A theory of communicating sequential processes. Tech. Report PRG-16, Oxford Univ. Programming Research Group, Oxford, England, 1981.
15. KENNAWAY, J.R. Formal semantics of nondeterminism and parallelism, D.Phil dissertation, Oxford Univ., Oxford, England, 1981.
16. LAMPORT, L. Proving the correctness of multiprocess programs. IEEE Trans. Softw. Eng. SE-3, 2 (Mar. 1977).
17. LEVIN, G.L. A proof technique for communicating sequential processes (with an example). Ph.D. dissertation, Cornell Univ., Ithaca, N.Y., 1979.
18. MILNE, R., AND STRACHEY, C. A Theory of Programming Language Semantics. Chapman Hall, London, and Wiley, New York, 1976.
19. MILNER, R. Algebras for communicating systems. Tech. Report CSR-25-78, Computer Science Dept., Edinburgh Univ., Edinburgh, England, 1978.
20. MILNER, R. A Calculus of Commumcating Systems Lecture Notes in Computer Science, vol. 92. Springer-Verlag, New York, 1980.
21. DE NICOLA, R. A complete set of axioms for a theory of communicating sequential processes. In Proceedings of the 1983 Conference on the Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 158. Springer-Verlag, New York, 1983.
22. PLOTKIN, G. An operational semantics for CSP. In Proceedings of the W.G.2.2 Conference, 1982.
23. ROSCOE, A.W. A mathematical theory of commumcating processes. D.Phil. dissertation, Oxford Univ., Oxford, England, 1982.
24. ROSCOE, A.W. Denotational Semantics for occam In preparation.
25. ROUNDS, W.C., AND BROOKES, S.D. Possible futures, acceptances, refusals and communicating processes. In Proceedings of the 22nd IEEE Foundations of Computer Science Symposium. IEEE, New York, 1981.
26. SCOTT, D.S. Data types as lattices. SIAMJ Comput. 5 (1976), 522-587.
27. SMYTH, M.B. Powerdomams. J Comput. Syst. Sci 16 (1978).
28. STOY, J.E. Denotational Semantics MIT Press, Cambridge, Mass., 1977.
29. ZHOU, C.C., AND HOARE, C.A.R. Partial correctness of communicating processes and protocols. Tech. Report PRG-20, Oxford Univ. Programming Research Group, Oxford, England, 1981.