Abstract
This is a sequel of [1] to give a temporal semantics to a full version of CSP, including hiding operator and nested parallelism. The semantic definition is of denotational style, and employs set of temporal formulas as denotations. The continuity is proved, when the hiding operator is restricted to channels only with finite possible messages.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Zhou Chaochen, A Temporal Semantics of CSP, Proc. of the First Pan Pacific Computer Conference, September 1985, Melbourne 617–630.
Zhou Chaochen, Specifying Distributed Systems with Temporal Logic, presented in “Colloquium on Temporal Logic”, Altrincham, England, April 1987.
D. S. Scott, Domains for Denotational Semantics, LNCS, Vol. 140, 577–612.
D.S. Scott, Lectures on a Mathematical Theory of Computation, M. Broy and G.Schmidt (edts.), Theoretical Foundations Programming Methodology, 145–292.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhou, C., Liu, X. Denote CSP with temporal formulas. J. of Comput. Sci. & Technol. 5, 17–23 (1990). https://doi.org/10.1007/BF02946560
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02946560