Abstract
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.
This work has been partially supported by the Italian MIUR project cometa (Computational Metamodels); and by EU within the FET – Global Computing initiative, project degas IST-2001-32072 (Design Environments for Global Applications).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π- calculus. Acta Informatica 35, 353–400 (1998)
Boudol, G., Castellani, I.: A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae 11, 433–452 (1988)
Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003)
Darondeau, P., Degano, P.: Causal trees. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol. 372, pp. 234–248. Springer, Heidelberg (1989)
Degano, P., De Nicola, R., Montanari, U.: Partial ordering derivations for CCS. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 520–533. Springer, Heidelberg (1985)
Degano, P., Gadducci, F., Priami, C.: A concurrent semantics for CCS via rewriting logic. Theoret. Comput. Sci. 275, 259–282 (2002)
Degano, P., Priami, C.: Proved trees. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 629–640. Springer, Heidelberg (1992)
Degano, P., Priami, C.: Non interleaving semantics for mobile processes. Theoret. Comput. Sci. 216, 237–270 (1999)
Degano, P., Priami, C.: Enhanced operational semantics: A tool for describing and analysing concurrent systems. ACM Computing Surveys 33, 135–176 (2001)
Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theoret. Comput. Sci. 153, 65–94 (1996)
Kiehn, A.: Comparing causality and locality based equivalences. Acta Informatica 31, 697–718 (1994)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
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)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Part I and II. Information and Computation 100, 1–77 (1992)
Sangiorgi, D.: Locality and interleaving semantics in calculi for mobile processes. Theoret. Comput. Sci. 155, 39–83 (1996)
Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Degano, P., Gadducci, F., Priami, C. (2004). Causality and Replication in Concurrent Processes. In: Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2003. Lecture Notes in Computer Science, vol 2890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39866-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-39866-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20813-6
Online ISBN: 978-3-540-39866-0
eBook Packages: Springer Book Archive