Abstract
In [9] an abstract version of Hoare's CSP is defined and a denotational semantics based on the possible failures of processes is given for it. This semantics induces a natural preorder on processes. We define formally this preorder and prove that it can be characterized as the smallest relation satisfying a particular set of axioms. The characterization will shed lights on problems arising from the way divergence and underspecification are handled.
On leave from Istituto di Elaborazione della Informazione, Pisa (Italy).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
LNCS n denotes Lecture Notes in Computer Science Volume n. Springer-Verlag
Asteslano,E. and Zucca,E. Semantics of CSP via translation into CCS, Proc. MFCS 1982, LNCS 116, 1982.
Brookes,S.D. A Model for Communicating Sequential Processes, Ph.D. thesis, University of Oxford, 1983.
De Nicola,R. and Hennessy,M. Testing equivalences for processes, Technical Report CSR-123-82. University of Edinburgh. To appear in Proc. ICALP '83.
Francez,N., Hoare,C.A.R., Lehmann,D.J. and De Roever,W.P. Semantics of nondeterminism, concurrency and communication. JCSS, Vol. 19, No. 3, 1979.
Guessarian,I. Algebraic Semantics, LNCS 99, 1981.
Hennessy, M., Milner, R. On Observing Nondeterminism and Concurrency. LNCS 85, pp. 299–309, 1980.
Hoare,C.A.R. Communicating Sequential Processes, CACM Vol. 21, No. 8, 1978.
Hoare,C.A.R. A Model for Communicating Sequential Processes. Technical Monograph Prg-22, Computing Laboratory, University of Oxford, 1982.
Hoare,C.A.R., Brookes,S.D., and Roscoe,A.D. A Theory of Communicating Sequential Processes, Technical Monograph Prg-16, Computing Laboratory, University of Oxford, 1981.
Milne,G. The representation of Communication and Concurrency, Internal Report, Computer Science Department, California Institute of Technology, 1980.
Milner, R. A Calculus of Communicating Systems, LNCS 92, 1980.
Olderog,E.R. and Hoare,C.A.R. Specification-Oriented Semantics for Communicating Processes, Unpublished Draft, Oxford University Computing Laboratory, 1982. To appear in Proc. ICALP '83.
Plotkin,G. A Powerdomain Constuction, SIAM J. on Computing, No. 5, pp. 452–486, 1976.
Plotkin,G. A Structural Approach to Operational Semantics, Lecture notes, Aarhus University, 1981.
Plotkin,G. An Operational Semantics for CSP. Internal Report, University of Edinburgh, CSR-114-82. To appear in Proc. IFIP WG 2.2 Working Conference on Formal Description of Programming Concepts II. North-Holland 198?.
Smyth, M.B. Power Domains, JCSS, Vol. 2, pp. 23–36, 1978.
Stoy,J. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, 1977
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Nicola, R. (1983). A complete set of axioms for a theory of communicating sequential processes. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_98
Download citation
DOI: https://doi.org/10.1007/3-540-12689-9_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12689-8
Online ISBN: 978-3-540-38682-7
eBook Packages: Springer Book Archive