Abstract
A semantic theory of an imperative language which allows value-passing and assignments as a simple action prefixing is described. Three different semantic approaches are given: denotational based on the mathematical model Acceptance Trees, axiomatic based on inequations and behavioural in terms of testing. The equivalence of these different approaches is shown. The results are compared with similar results for other languages such asCSP andOccam.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brookes, S.D., Hoare, C.A.R. and Roscoe, A.W. “A Theory of Communicating Sequential Processes”,JACM 31(7), 560–599 1984.
Brinksma, E. “A Tutorial on LOTOS.”Proceedings of IFIP Workshop on Protocol Specification, Testing and Verification V, M. Diaz, ed., pp. 73–84. North-Holland, Amsterdam, 1986.
DeNicola, R. and M. Hennessy. “Testing Equivalences for Processes.”Theoretical Computer Science, 24, 1984, pp. 83–113.
Francez, N., Lehman, D. and Pnueli, A. “A Linear History of Semantics for Languages with Distributed Processing,TCS, 32, 25–46, 1984.
Guessarian, I., “Algebraic Semantics”,Springer-Verlag Lecture Notes in Computer Science, vol.99, 1981.
Hennessy, M., Ingólfsdóttir, A. A Theory of Communicating Processes With Value-Passing, University of Sussex Technical Report No 3/89, 1989. To appear in Information and Computation
Hennessy, M. “Acceptance Trees.”Journal of the ACM, v. 32, n. 4, October 1985, pp. 896–928.
Hennessy, M.Algebraic Theory of Processes. MIT Press, Cambridge, 1988.
Hennessy, M., A Proof System for Communicating Processes With Value - Passing,Formal Aspects of Computing, vol.3, 1991, pp. 346–366.
Hennessy, M. and Plotkin, G., “A Term Model for CCS”,Springer-Verlag Lecture Notes in Computer Science, vol.88, 1980.
Hoare, C.A.R. “Communicating Sequential Processes”,Comm. ACM, 21(8), 666–677 1978.
Hoare, C.A.R.Communicating Sequential Processes. Prentice-Hall International, London, 1985.
Hoare, C.A.R. and Roscoe, A.W., “The Laws of Occam”, TCS 60, pp 177–229, 1988.
Inmos Ltd.,The Occam Programming Manual, Prentice-Hall, London, 1984.
Milner, R.A Calculus of Communicating Systems, Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980.
Milne, R., “Concurrency Models and Axioms”, RAISE/STC/REM/6/V2, STC Technology Ltd., 1988.
Milner, R.,Calculus for Communication and Concurrency, Prentice-Hall, London 1989.
Olderog, E.R., Process Theory: Semantics, Specifications and Verifications, in J.W. deBakker, W.P. deRover, G. Rozenberg (Eds), Current Trends in Concurrency, Lecture Notes in Computer Science 224, Springer-Verlag, 1986, pp 442–509.
Plotkin, G., “Lecture Notes in Domain Theory”, University of Edinburgh, 1981.
Plotkin, G., “An Operational Semantics for CSP”,Proc. of IFIP WG 2.2, Working Conference on Formal Description of Programming Concepts 11, 1989.
Roscoe, A.W., “Denotational Semantics for Occam”, PRG Monograph, Oxford University, 1988.
Schmidt, D.,Denotational Semantics, Allen and Bacon, 1986.
Smyth, M. and Plotkin, G., “The Category-Theoretic Solution of Recursive Domain Equations”,SIAM Journal on Computing, vol.11, No.4, 1982.
Author information
Authors and Affiliations
Additional information
This work has partly been supported by the ESPRIT/BRA project Concur
Rights and permissions
About this article
Cite this article
Hennessy, M., Ingólfsdóttir, A. Communicating processes with value-passing and assignments. Formal Aspects of Computing 5, 432–466 (1993). https://doi.org/10.1007/BF01212486
Issue Date:
DOI: https://doi.org/10.1007/BF01212486