Abstract
We propose the first compositional event structure semantics for a very expressive π-calculus, generalising Winskel’s event structures for CCS. The π-calculus we model is the πI-calculus with recursive definitions and summations. First we model the synchronous calculus, introducing a notion of dynamic renaming to the standard operators on event structures. Then we model the asynchronous calculus, for which a new additional operator, called rooting, is necessary for representing causality due to new name binding. The semantics are shown to be operationally adequate and sound with respect to bisimulation.
Work partially supported by MIUR (project 2005015785), Università di Padova (project CPDA061331), EPSRC (GR/S55538/01, GR/T04724/01 and GR/T03208/01) and ANR (project ParSec ANR-06-SETI-010-02).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 29–45. Springer, Heidelberg (2001)
Boreale, M.: On the expressiveness of internal mobility in name-passing calculi. Theor. Comp. Sci. 195(2), 205–226 (1998)
Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the π-calculus. Acta Inf. 35(5), 353–400 (1998)
Boudol, G.: Asynchrony and the π-calculus. Research Report 1702, INRIA (1992)
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)
Cattani, G.L., Sewell, P.: Models for name-passing processes: Interleaving and causal. In: Proc. of LICS, pp. 322–332. IEEE Computer Society Press, Los Alamitos (2000)
Crafa, S., Varacca, D., Yoshida, N.: Compositional event structure semantics for the internal pi-calculus. Full version, available at www.pps.jussieu.fr/~varacca
Curien, P.-L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 167–183. Springer, Heidelberg (2005)
Degano, P., De Nicola, R., Montanari, U.: On the consistency of “truly concurrent” operational and denotational semantics. In: Proc. of LICS, pp. 133–141. IEEE Computer Society Press, Los Alamitos (1988)
Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theor. Comp. Sci. 216(1-2), 237–270 (1999)
Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theor. Comp. Sci. 153(1&2), 65–94 (1996)
Faggian, C., Piccolo, M.: A graph abstract machine describing event structure composition. In: GT-VC workshop, ENTCS (2007)
Faggian, C., Piccolo, M.: Ludics is a model for the (finitary) linear pi-calculus. In: Proc. of TLCA. LNCS, Springer, Heidelberg (2007)
Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)
Jagadeesan, L.J., Jagadeesan, R.: Causality and true concurrency: A data-flow analysis of the pi-calculus. In: Alagar, V.S., Nivat, M. (eds.) AMAST 1995. LNCS, vol. 936, pp. 277–291. Springer, Heidelberg (1995)
Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. Math. Struct. Comp. Sci. 14, 715–767 (2004)
Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comp. Sci. 13(1), 85–108 (1981)
Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Struct. Comp. Sci. 13(5), 685–719 (2003)
Sangiorgi, D.: π-calculus, internal mobility and agent passing calculi. Theor. Comp. Sci. 167(2), 235–271 (1996)
Varacca, D., Yoshida, N.: Typed event structures and the π-calculus. In: Proc. of MFPS XXII. ENTCS, vol. 158, pp. 373–397. Elsevier, Amsterdam (2006), Full version available at http://www.pps.jussieu.fr/~varacca
Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol. 140, pp. 561–576. Springer, Heidelberg (1982)
Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. Proceedings of an Advanced Course. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)
Winskel, G.: Name generation and linearity. In: Proc. of LICS, pp. 301–310. IEEE Computer Society Press, Los Alamitos (2005)
Winskel, G.: Relations in concurrency. In: Proc. of LICS, pp. 2–11. IEEE Computer Society Press, Los Alamitos (2005)
Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of logic in Computer Science, vol. 4, Clarendon Press, Oxford (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crafa, S., Varacca, D., Yoshida, N. (2007). Compositional Event Structure Semantics for the Internal π-Calculus . In: Caires, L., Vasconcelos, V.T. (eds) CONCUR 2007 – Concurrency Theory. CONCUR 2007. Lecture Notes in Computer Science, vol 4703. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74407-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74407-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74406-1
Online ISBN: 978-3-540-74407-8
eBook Packages: Computer ScienceComputer Science (R0)