zbMATH — the first resource for mathematics

Parametric channels via label expressions in CCS. (English) Zbl 0542.68017
Summary: CCS, the Calculus of Communicating Systems devised by Milner, has proved extremely successful for providing, via translation, a sound mathematical basis for a wide class of concurrent languages. Nevertheless, as it stands, it suffers from a limitation: it is impossible to determine at run time the channel on which to send or receive a communication. There are various possibilities for giving CCS such ability, but the price can be a drastic change in the language and the theory of CCS. Here we present a simple solution to this problem, which keeps language and theory almost unchanged, at least in fundamental aspects: the essential idea is to extend CCS by allowing (channel-) label expressions. We also show various applications of this extended version of CCS.

68N25 Theory of operating systems
Full Text: DOI
[1] Astesiano, E.; Zucca, E., Semantics of CSP via translation into CCS, ()
[2] Astesiano, E.; Zucca, E., Semantics of distributed processes derived by translation, () · Zbl 0503.68020
[3] Bjørner, D.; Folkjaer, P., A formal model of a generalized CSP-like language, ()
[4] Bjørner, D.; Oest, O., Towards a formal description of ADA, () · Zbl 0451.68015
[5] Hoare, C.A.R., Communicating sequential processes, Comm. ACM, 21, 8, (1978) · Zbl 0383.68028
[6] Hennessy, M.; Li, W.; Plotkin, G., A first attempt at translating CSP into CCS, ()
[7] Milner, R., A calculus of communicating systems, () · Zbl 0452.68027
[8] Milner, R., Calculi for synchrony and asynchrony, Theoret. comput. sci., 25, 3, 267-310, (1983) · Zbl 0512.68026
[9] Plotkin, G., A structural approach to operational semantics, (), Lecture notes · Zbl 1082.68062
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.