Abstract
This paper presents a novel causal semantics for concurrency, based on rigid families. Instead of having causality as primitive notion, in our model causality and concurrency are derived from precedence, a partial order local to each run of a process. We show that our causal semantics can interpret CCS and \(\pi \)-calculus terms. We propose some criteria to evaluate the correctness of a causal semantics of process calculi and we argue that none of the previous models for the \(\pi \)-calculus satisfy them all.
I.D. Cristescu – Partially supported by the ANR grant (REVER) ANR-11-INSE-0007.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We let the reader refer to appendix for details. We also show in appendix how one can compile an event structure from rigid families and vice versa. Importantly, the category of Definition 2 and the category of event structures are not equivalent.
References
Aubert, C., Cristescu, I.: Reversible barbed congruence on configuration structures. In: 8th ICE, Satellite Workshop of DisCoTec 2015 (2015)
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \(\pi \)-calculus. Acta. Inf. 35(5), 353–400 (1998)
Boudol, G., Castellani, I.: Flow models of distributed computations: Three equivalent semantics for CCS. Inf. Comput. 114(2), 247–314 (1994)
Bruni, R., Melgratti, H., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 295–309. Springer, Heidelberg (2006)
Busi, N., Gorrieri, R.: A petri net semantics for \(\pi \)-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 145–159. Springer, Heidelberg (1995)
Castellan, S., Hayman, J., Lasson, M., Winskel, G.: Strategies as concurrent processes. Electron. Notes. Theor. Comput. Sci. 308, 87–107 (2014). Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics (MFPS XXX)
Cattani, G.L., Sewell, P.: Models for name-passing processes: Interleaving and causal. Inf. Comput. 190(2), 136–178 (2004)
Cattani, G.L., Winskel, G.: Presheaf models for CCS-like languages. Theor. Comput. Sci. 300(1–3), 47–89 (2003)
Crafa, S., Varacca, D., Yoshida, N.: Event structure semantics of parallel extrusion in the \(\pi \)-calculus. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 225–239. Springer, Heidelberg (2012)
Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible \(\pi \)-calculus. In: LICS 2013, pp. 388–397. IEEE Computer Society (2013)
Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292–307. Springer, Heidelberg (2004)
Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theor. Comput. Sci. 216(1–2), 237–270 (1999)
Eberhart, C., Hirschowitz, T., Seiller, T.: An intensionally fully-abstract sheaf model for \(\pi \). In: CALCO (2015)
van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and petri nets. Theor. Comput. Sci. 410(41), 4111–4159 (2009)
Hayman, J., Winskel, G.: Event structure semantics for security protocols (2013). submitted for publication
Krivine, J.: A verification algorithm for declarative concurrent programming. Technical Report 0606095, INRIA-Rocquencourt (2006)
Milner, R.: Communication and Concurrency. Prentice-Hall Inc, Upper Saddle River (1989)
Milner, R.: Communicating and Mobile Systems: The \(\pi \)-calculus. Cambridge University Press, Cambridge (1999)
Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. Electron. Notes Theor. Comput. Sci. 192(1), 93–108 (2007)
Sangiorgi, D., Walker, D.: PI-Calculus: A Theory of Mobile Processes. Cambridge University Press, New York (2001)
Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: towards a classification. Theor. Comput. Sci. 170(1–2), 297–348 (1996)
Winskel, G.: Event structure semantics for CCS and related languages. In: Proceedings of the 9th Colloquium on Automata, Languages and Programming, pp. 561–576 (1982)
Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Yoshida, N.: Minimality and separation results on asynchronous mobile processes. Theor. Comput. Sci. 274(1–2), 231–276 (2002). Ninth International Conference on Concurrency Theory 1998
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cristescu, I.D., Krivine, J., Varacca, D. (2015). Rigid Families for CCS and the \(\pi \)-calculus. In: Leucker, M., Rueda, C., Valencia, F. (eds) Theoretical Aspects of Computing - ICTAC 2015. ICTAC 2015. Lecture Notes in Computer Science(), vol 9399. Springer, Cham. https://doi.org/10.1007/978-3-319-25150-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-25150-9_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25149-3
Online ISBN: 978-3-319-25150-9
eBook Packages: Computer ScienceComputer Science (R0)