论文信息 - Unbounded Nondeterminism in CSP

Unbounded Nondeterminism in CSP

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 | Geoff Barrett | G. Barrett

[1] C. A. R. Hoare,et al. A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[2] Bill Roscoe,et al. An Operational Semantics for CSP , 1986 .

[3] G. M. Reed. A uniform mathematical theory for real-time distributed computingT , 1988 .

[4] A. W. Roscoe,et al. A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[5] C. A. R. Hoare,et al. A Theory of Communicating Sequential Processes , 1984, JACM.

[6] A. W. Roscoe,et al. An Improved Failures Model for Communicating Processes , 1984, Seminar on Concurrency.

[7] Stephen Blamey,et al. The soundness and completeness of axioms for CSP processes , 1991 .

[8] A. W. Roscoe,et al. Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[9] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[10] Andrew William Roscoe. A mathematical theory of communicating processes , 1982 .