{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:12:43Z","timestamp":1767237163754},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_22","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T14:30:48Z","timestamp":1187447448000},"page":"317-332","source":"Crossref","is-referenced-by-count":7,"title":["Compositional Event Structure Semantics for the Internal \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Silvia","family":"Crafa","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Varacca","sequence":"additional","affiliation":[]},{"given":"Nobuko","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-45413-6_7","volume-title":"Typed Lambda Calculi and Applications","author":"M. Berger","year":"2001","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the \u03c0-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol.\u00a02044, pp. 29\u201345. Springer, Heidelberg (2001)"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","volume":"195","author":"M. Boreale","year":"1998","unstructured":"Boreale, M.: On the expressiveness of internal mobility in name-passing calculi. Theor. Comp. Sci.\u00a0195(2), 205\u2013226 (1998)","journal-title":"Theor. Comp. Sci."},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s002360050124","volume":"35","author":"M. Boreale","year":"1998","unstructured":"Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the \u03c0-calculus. Acta Inf.\u00a035(5), 353\u2013400 (1998)","journal-title":"Acta Inf."},{"key":"22_CR4","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus. Research Report 1702, INRIA (1992)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11817949_20","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: Event structure semantics for nominal calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 295\u2013309. Springer, Heidelberg (2006)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-60218-6_11","volume-title":"CONCUR \u201995 Concurrency Theory","author":"N. Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: A petri net semantics for pi-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 145\u2013159. Springer, Heidelberg (1995)"},{"key":"22_CR7","first-page":"322","volume-title":"Proc. of LICS","author":"G.L. Cattani","year":"2000","unstructured":"Cattani, G.L., Sewell, P.: Models for name-passing processes: Interleaving and causal. In: Proc. of LICS, pp. 322\u2013332. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"22_CR8","unstructured":"Crafa, S., Varacca, D., Yoshida, N.: Compositional event structure semantics for the internal pi-calculus. Full version, available at \n                    \n                      www.pps.jussieu.fr\/~varacca"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/11538363_13","volume-title":"Computer Science Logic","author":"P.-L. Curien","year":"2005","unstructured":"Curien, P.-L., Faggian, C.: L-nets, strategies and proof-nets. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 167\u2013183. Springer, Heidelberg (2005)"},{"key":"22_CR10","first-page":"133","volume-title":"Proc. of LICS","author":"P. Degano","year":"1988","unstructured":"Degano, P., De Nicola, R., Montanari, U.: On the consistency of \u201ctruly concurrent\u201d operational and denotational semantics. In: Proc. of LICS, pp. 133\u2013141. IEEE Computer Society Press, Los Alamitos (1988)"},{"issue":"1-2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","volume":"216","author":"P. Degano","year":"1999","unstructured":"Degano, P., Priami, C.: Non-interleaving semantics for mobile processes. Theor. Comp. Sci.\u00a0216(1-2), 237\u2013270 (1999)","journal-title":"Theor. Comp. Sci."},{"issue":"1&2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(95)00118-2","volume":"153","author":"J. Engelfriet","year":"1996","unstructured":"Engelfriet, J.: A multiset semantics for the pi-calculus with replication. Theor. Comp. Sci.\u00a0153(1&2), 65\u201394 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Faggian, C., Piccolo, M.: A graph abstract machine describing event structure composition. In: GT-VC workshop, ENTCS (2007)","DOI":"10.1016\/j.entcs.2007.04.014"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. of TLCA","author":"C. Faggian","year":"2007","unstructured":"Faggian, C., Piccolo, M.: Ludics is a model for the (finitary) linear pi-calculus. In: Proc. of TLCA. LNCS, Springer, Heidelberg (2007)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-60043-4_59","volume-title":"Algebraic Methodology and Software Technology","author":"L.J. Jagadeesan","year":"1995","unstructured":"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.\u00a0936, pp. 277\u2013291. Springer, Heidelberg (1995)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1017\/S0960129504004323","volume":"14","author":"M. Merro","year":"2004","unstructured":"Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. Math. Struct. Comp. Sci.\u00a014, 715\u2013767 (2004)","journal-title":"Math. Struct. Comp. Sci."},{"issue":"1","key":"22_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comp. Sci.\u00a013(1), 85\u2013108 (1981)","journal-title":"Theor. Comp. Sci."},{"issue":"5","key":"22_CR19","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous pi-calculi. Math. Struct. Comp. Sci.\u00a013(5), 685\u2013719 (2003)","journal-title":"Math. Struct. Comp. Sci."},{"issue":"2","key":"22_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: \u03c0-calculus, internal mobility and agent passing calculi. Theor. Comp. Sci.\u00a0167(2), 235\u2013271 (1996)","journal-title":"Theor. Comp. Sci."},{"key":"22_CR21","series-title":"ENTCS","first-page":"373","volume-title":"Proc. of MFPS XXII","author":"D. Varacca","year":"2006","unstructured":"Varacca, D., Yoshida, N.: Typed event structures and the \u03c0-calculus. In: Proc. of MFPS XXII. ENTCS, vol.\u00a0158, pp. 373\u2013397. Elsevier, Amsterdam (2006), Full version available at \n                    \n                      http:\/\/www.pps.jussieu.fr\/~varacca"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BFb0012800","volume-title":"Automata, Languages, and Programming","author":"G. Winskel","year":"1982","unstructured":"Winskel, G.: Event structure semantics for CCS and related languages. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol.\u00a0140, pp. 561\u2013576. Springer, Heidelberg (1982)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Advances in Petri Nets 1986. Proceedings of an Advanced Course","author":"G. Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Advances in Petri Nets 1986. Proceedings of an Advanced Course. LNCS, vol.\u00a0255, pp. 325\u2013392. Springer, Heidelberg (1987)"},{"key":"22_CR24","first-page":"301","volume-title":"Proc. of LICS","author":"G. Winskel","year":"2005","unstructured":"Winskel, G.: Name generation and linearity. In: Proc. of LICS, pp. 301\u2013310. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"22_CR25","first-page":"2","volume-title":"Proc. of LICS","author":"G. Winskel","year":"2005","unstructured":"Winskel, G.: Relations in concurrency. In: Proc. of LICS, pp. 2\u201311. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"22_CR26","volume-title":"Handbook of logic in Computer Science","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of logic in Computer Science, vol.\u00a04, Clarendon Press, Oxford (1995)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:25:02Z","timestamp":1619519102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}