Abstract
We extend the failures/divergences model for CSP to include a component of infinite traces. This allows us to give a denotational semantics for a version of CSP including general nondeterministic choice and infinite hiding. Unfortunately the model is an incomplete partial order, so it is by no means obvious that the necessary fixed points exist. We have two proofs of this result, one via a congruence theorem with operational semantics and one via a careful analysis of operators' behaviour on a subset of the model.
A.W. Roscoe gratefully acknowledges support from ONR grant N00014-87-G-0242.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brookes, S.D., A Model for Communicating Sequential Processes, Oxford University D.Phil. thesis, 1983.
Blamey, S.R., The soundness and completeness of axioms for CSP processes, submitted for publication.
Brookes, S.D., Hoare, C.A.R., and Roscoe, A.W., A theory of communicating sequential processes, JACM Vol. 31, No. 3 (July 1984) 560–599.
Brookes, S.D. and Roscoe, A.W., An improved failures model for communicating processes in Proc. of Pittsburgh symposium on concurrency, Springer LNCS !97 (1985).
Brookes, S.D., Roscoe A.W., and Walker, D.J., An operational semantics for CSP, Submitted for publication.
Hoare, C.A.R., Communicating sequential processes, Prentice-Hall, 1985
He Jifeng and Hoare, C.A.R., Algebraic specification and proof of properties of communicating sequential processes, Technical monograph PRG-52, Oxford University Computing Laboratory.
Roscoe, A.W., A mathematical theory of communicating processes, Oxford University D.Phil. thesis, 1982.
Roscoe, A.W., An alternative order for the failures model, in ‘Two Papers on CSP', Technical monograph PRG-67, Oxford University Computing Laboratory.
Roscoe, A.W., Unbounded nondeterminism in CSP, in ‘Two Papers on CSP', Technical monograph PRG-67, Oxford University Computing Laboratory.
Roscoe, A.W., Analysing infinitely branching trees, in preparation.
Reed, G.M., A uniform mathematical theory for real-time distributed computing, Oxford University D.Phil. thesis, 1988.
Reed, G.M., and Roscoe, A.W., A timed model for communicating sequential processes, Proceedings of ICALP'86, Springer LNCSS 226 (1986), 314–323.
Reed, G.M., and Roscoe, A.W., Metric spaces as models for real-time concurrency, in the proceedings of MFPLS87 Springer LNCS 298 (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roscoe, A.W., Barrett, G. (1990). Unbounded nondeterminism in CSP. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040257
Download citation
DOI: https://doi.org/10.1007/BFb0040257
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97375-3
Online ISBN: 978-0-387-34808-7
eBook Packages: Springer Book Archive