Abstract
It is shown how control aspects of the CSP-like communication mechanism may be represented as cause-effect structures, by using their calculus. A correctness proof of this transformation, i.e. its preserving of behaviour, has been given. A CSP-like parallel combinator for c-e structures is proposed, as well as its semantic counterpart. Compositionality property is proved.
Get full access to this article
View all access options for this article.