Abstract
A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.
- 1 AFI', 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. Google Scholar
- 2 BROOKES, S.D.Amodel for eommumcating sequential processes. D.Phil. d~ssertation, Oxford Univ., Oxford, England, 1983.Google Scholar
- 3 BROOKES, S.D.On the relationship of CCS and CSP. In Proceedmgs of the 1983 Internattonal Conference on Automata, Languages, and Programming (ICALP 83) Lecture Notes in Computer Science, vol. 154. Springer-Vedag, New York, 1983. Google Scholar
- 4 BROOKES, S. D.A semantics and proof system for communicating protests. In Proceedings of the NSF/ONR Conference on Logics of Programs. Lecture Notes in Computer Science, vol. 164. Springer-Verlag, New York, 1983. Google Scholar
- 5 BROOKES, S.D., AND ROSC'OE, A.W. An improved failures model for communieattng processes, to be published as CMU Teeh. Rep., 1984.Google Scholar
- 6 CHANDY, R.M., AND MISRA, J. An axaomatic proof technique for networks of communicating processes. Tech. Report TR-98, Univ. of Texas, Austin, "rex. Google Scholar
- 7 DI/KSTRA, E.W.Cooperating sequential processes. In Programmmg Languages, F. Genuys, Ed. Academic Press, New York, 1968.Google Scholar
- 8 FRANCEZ, N., LEHMANN, D., AND PNEULI, A. A linear history semantics of languages for dJstnbuted programming. In Proceedings of the 21st IEEE Foundations of Computer Science Symposium iEEE, New York, 1980.Google Scholar
- 9 HENNESSY, M., AND MILNER, R.On observing nondeterminism and concurrency. In Proceedings of the 1980 International Conference on Automata, Languages, and Programming (ICALP 80). Lecture Notes in Computer Science, vol. 85. Springer-Verlag New York, 1980. Google Scholar
- 10 HENNESS'r, M., AND DE NfCOLA, R,Testing equivalences for processes. In Proceedmgs of the 1983 lnternattonal Conference on Automata, Languages, and Programming (ICALP 83). Lecture Notes in Computer Science, vol. 154. Springer-Verlag, New York, 1983.Google Scholar
- 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 Spdnger-Vedag, New York, 1980. Google Scholar
- 12 HOARE, C.A.R.Communicating sequentml processes. Commun ACM 21, 8 (Aug. 1978), 666-676. Google Scholar
- 13 HOARE, C. A. R.A model for commumcating sequential processes. Tech. Report PRG-22, Oxford Untv. Programming Research Group, Oxford, England, 1981.Google Scholar
- 14 HOARE, C.A.R., BROOKES, S.D., AND ROSCOE, A.W. A theory of communicating sequential processes. Teeh. Report PRG-t6, Oxford Univ. Programming Research Group, Oxford, England, 1981.Google Scholar
- 15 KENNAWAY, J.R.Formal semantics of nondeterminism and parallelism, D.Phii, dissertation, Oxford Univ., Oxford, England, 1981.Google Scholar
- 16 LAMPORT, L.Proving the correctness of mulfiprocess programs, IEEE Trans. Soflw. Eng. SE-3, 2 (Mar. 1977).Google Scholar
- 17 LEVlN, G. L.A proof technique for communicating sequential processes (with an example). Ph.D. dissertation, Cornell Univ., Ithaca, N.Y., 1979. Google Scholar
- 18 MILNE, R., AND STRACHEY, C.A Theory of Programming Language Semantics. Chapman Hall, London, and Wiley, New York, 1976. Google Scholar
- 19 MILNER, R.Algebras for communicating systems. Tech. Report CSR-25-78, Computer Science Dept., Edinburgh Umv., Edinburgh, England, 1978.Google Scholar
- 20 MILNER, R. A Calculus of Communtcating Systems Lecture Notes in Computer Science, vol. 92. Springer-Vedag, New York, 1980. Google Scholar
- 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. Spnnger-Vedag, New York, 1983. Google Scholar
- 22 PLOTKIN, G.An operational semantics for CSP. In Proceedmgs of the W.G.Z2 Conference, 1982.Google Scholar
- 23 RoscoE, A.W.A mathematical theory of commumcating processes. D.Pkil. dissertation, Oxford Umv., Oxford, England, 1982.Google Scholar
- 24 ROSCOE, A. W. Denotational Semantics for occam In preparation.Google Scholar
- 25 Roum>s, 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.Google Scholar
- 26 SCOTT, D.S.Data types as latttces. SIAM J Comput. 5 (1976), 522-587.Google Scholar
- 27 SMYTH, M.B.Powerdomams. J Comput. Syst. Sct 16 (1978).Google Scholar
- 28 STOY, J. E.Denotatmnat Semanttcs MIT Press, Cambridge, Mass., 1977.Google Scholar
- 29 ZHou, C.C., AND HOARE, C. A.R. Partial correctness of communicating processes and protocols. Tech. Report PRG-20, Oxford Umv. Programming Research Group, Oxford, England, 1981.Google Scholar
Index Terms
- A Theory of Communicating Sequential Processes
Recommendations
A Proof System for Communicating Sequential Processes
An axiomatic proof system is presented for proving partial correctness and absence of deadlock (and failure) of communicating sequential processes. The key (meta) rule introduces cooperation between proofs, a new concept needed to deal with proofs about ...
Comments on “Communicating Sequential Processes”
In his recent paper, “Communicating Sequential Processes” (Comm. ACM 21, 8 (Aug. 1978), 666-677), C.A.R. Hoare outlines a programming language notation for interprocess communication in which processes are synchronized by the messages they exchange. The ...
Comments