Causality and Replication in Concurrent Processes
The replication operator was introduced by Milner for obtaining a simplified description of recursive processes. The standard interleaving semantics denotes the replication of a process P, written ! P, a shorthand for its unbound parallel composition, operationally equivalent to the process P| P| ... , with P repeated as many times as needed.
Albeit the replication mechanism has become increasingly popular, investigations on its causal semantics has been scarce. In our work we consider the interleaving semantics for the operator proposed by Sangiorgi and Walker, and we show how to refine it in order to capture causality.
Furthermore, we prove that a basic property usually associated to these semantics, the so-called concurrency diamond, does hold in our framework, and we sketch a correspondence between our proposal and the standard causal semantics for recursive process studied in the literature, for processes defined through constant invocations.
KeywordsCausal semantics process calculi replication operator
Unable to display preview. Download preview PDF.
- 7.Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 629–640. Springer, Heidelberg (1992)Google Scholar
- 13.Milner, R.: The polyadic π-calculus: A tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification. Nato ASI Series F, vol. 94, pp. 203–246. Springer, Heidelberg (1993)Google Scholar
- 16.Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)Google Scholar