Denote CSP with temporal formulas
暂无分享,去创建一个
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.
[1] Dana S. Scott,et al. Lectures on a Mathematical Theory of Computation , 1982 .
[2] Dana S. Scott,et al. Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.