{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:40:02Z","timestamp":1750110002627,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662544570"},{"type":"electronic","value":"9783662544587"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54458-7_23","type":"book-chapter","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T09:22:57Z","timestamp":1489569777000},"page":"389-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Truly Concurrent Game Model of the Asynchronous $$\\pi $$-Calculus"],"prefix":"10.1007","author":[{"given":"Ken","family":"Sakayori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tsukada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Inf. Comput. 163(2), 409\u2013470 (2000)","journal-title":"Inf. Comput."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S1571-0661(05)80398-6","volume":"3","author":"S Abramsky","year":"1996","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. Electr. Notes Theor. Comput. Sci. 3, 2\u201314 (1996)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: 14th Annual IEEE Symposium on Logic in Computer Science, pp. 431\u2013442 (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: Timeless games. In: 11th International Workshop on Computer Science Logic, pp. 56\u201377 (1997)","DOI":"10.1007\/BFb0028007"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Berger, M., Honda, K., Yoshida, N.: Sequentiality and the pi-calculus. In: TLCA, pp. 29\u201345 (2001)","DOI":"10.1007\/3-540-45413-6_7"},{"issue":"2","key":"23_CR6","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. Comput. Sci. 195(2), 205\u2013226 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-02273-9_7","volume-title":"Typed Lambda Calculi and Applications","author":"P Boudes","year":"2009","unstructured":"Boudes, P.: Thick subtrees, games and experiments. In: Curien, P.-L. (ed.) TLCA 2009. LNCS, vol. 5608, pp. 65\u201379. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-02273-9_7"},{"key":"23_CR8","unstructured":"Castellan, S., Clairambault, P.: Causality vs. interleavings in concurrent game semantics. In: 27th International Conference on Concurrency Theory, CONCUR 2016, pp. 32:1\u201332:14 (2016)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Castellan, S., Clairambault, P., Winskel, G.: Symmetry in concurrent games. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, pp. 28:1\u201328:10 (2014)","DOI":"10.1145\/2603088.2603141"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Castellan, S., Clairambault, P., Winskel, G.: The parallel intensionally fully abstract games model of PCF. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, pp. 232\u2013243 (2015)","DOI":"10.1109\/LICS.2015.31"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Crafa, S., Varacca, D., Yoshida, N.: Compositional event structure semantics for the internal $$pi$$-calculus. In: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, pp. 317\u2013332 (2007)","DOI":"10.1007\/978-3-540-74407-8_22"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Crafa, S., Varacca, D., Yoshida, N.: Event structure semantics of parallel extrusion in the pi-calculus. In: Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, pp. 225\u2013239 (2012)","DOI":"10.1007\/978-3-642-28729-9_15"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ic.2011.12.006","volume":"214","author":"P-L Curien","year":"2012","unstructured":"Curien, P.-L., Faggian, C.: An approach to innocent strategies as graphs. Inf. Comput. 214, 119\u2013155 (2012)","journal-title":"Inf. Comput."},{"key":"23_CR14","unstructured":"Di Gianantonio, P., Lenisa, M.: Innocent game semantics via intersection type assignment systems. In: Computer Science Logic 2013, CSL 2013, pp. 231\u2013247 (2013)"},{"issue":"6","key":"23_CR15","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.ic.2009.06.005","volume":"208","author":"T Ehrhard","year":"2010","unstructured":"Ehrhard, T., Laurent, O.: Interpreting a finitary pi-calculus in differential interaction nets. Inf. Comput. 208(6), 606\u2013633 (2010)","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"23_CR16","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2008.06.001","volume":"403","author":"T Ehrhard","year":"2008","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the taylor expansion of ordinary lambda-terms. Theor. Comput. Sci. 403(2\u20133), 347\u2013372 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Faggian, C., Maurel, F.: Ludics nets, a game model of concurrent interaction. In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 376\u2013385 (2005)","DOI":"10.1109\/LICS.2005.25"},{"issue":"2\u20133","key":"23_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.apal.2007.10.005","volume":"151","author":"DR Ghica","year":"2008","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. Ann. Pure Appl. Logic 151(2\u20133), 89\u2013114 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"22\u201324","key":"23_CR19","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.tcs.2010.01.028","volume":"411","author":"K Honda","year":"2010","unstructured":"Honda, K., Laurent, O.: An exact correspondence between a typed pi-calculus and polarised proof-nets. Theor. Comput. Sci. 411(22\u201324), 2223\u20132238 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: Pi-calculus, dialogue games and PCF. In: Proceedings of the Seventh International Conference on Functional Programming Languages and Computer Architecture, FPCA 1995, pp. 96\u2013107 (1995)","DOI":"10.1145\/224164.224189"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-60043-4_59","volume-title":"Algebraic Methodology and Software Technology","author":"L Jategaonkar Jagadeesan","year":"1995","unstructured":"Jategaonkar Jagadeesan, L., 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\u2013291. Springer, Heidelberg (1995). doi:10.1007\/3-540-60043-4_59"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S1571-0661(04)80965-4","volume":"45","author":"J Laird","year":"2001","unstructured":"Laird, J.: A game semantics of idealized CSP. Electr. Notes Theor. Comput. Sci. 45, 232\u2013257 (2001)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Laird, J.: A game semantics of the asynchronous $$\\pi $$-calculus. In: 16th International Conference on CONCUR 2005 - Concurrency Theory, pp. 51\u201365 (2005)","DOI":"10.1007\/11539452_8"},{"key":"23_CR25","unstructured":"Levy, P.B.: Morphisms between plays. In: Lecture Slides, GaLoP (2013)"},{"key":"23_CR26","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 1: a group-theoretic formulation of uniformity (2003). (Unpublished manuscript)"},{"issue":"2\u20133","key":"23_CR27","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"P-A Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 2: the true concurrency of innocence. Theor. Comput. Sci. 358(2\u20133), 200\u2013228 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Game semantics in string diagrams. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, pp. 481\u2013490 (2012)","DOI":"10.1109\/LICS.2012.58"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74407-8_27","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"P-A Melli\u00e8s","year":"2007","unstructured":"Melli\u00e8s, P.-A., Mimram, S.: Asynchronous games: innocence without alternation. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 395\u2013411. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74407-8_27"},{"key":"23_CR30","unstructured":"Melli\u00e8s, P.-A., Mimram, S.: From asynchronous games to concurrent games (2008). (Unpublished manuscript)"},{"issue":"4","key":"23_CR31","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1561\/2500000017","volume":"2","author":"AS Murawski","year":"2016","unstructured":"Murawski, A.S., Tzevelekos, N.: Nominal game semantics. Found. Trends Program. Lang. 2(4), 191\u2013269 (2016)","journal-title":"Found. Trends Program. Lang."},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-58140-5_25","volume-title":"Logical Foundations of Computer Science","author":"H Nickau","year":"1994","unstructured":"Nickau, H.: Hereditarily sequential functionals. In: Nerode, A., Matiyasevich, Y.V. (eds.) LFCS 1994. LNCS, vol. 813, pp. 253\u2013264. Springer, Heidelberg (1994). doi:10.1007\/3-540-58140-5_25"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Power, J., Thielecke, H.: Closed Freyd-and kappa-categories. In: Automata, Languages and Programming. In: 26th International Colloquium, ICALP 1999, pp. 625\u2013634 (1999)","DOI":"10.1007\/3-540-48523-6_59"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Rideau, S., Winskel, G.: Concurrent strategies. In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, pp. 409\u2013418 (2011)","DOI":"10.1109\/LICS.2011.13"},{"issue":"1&2","key":"23_CR35","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.: pi-calculus, internal mobility, and agent-passing calculi. Theor. Comput. Sci. 167(1&2), 235\u2013274 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Tsukada, T., Ong, C.-H.L.: Nondeterminism in game semantics via sheaves. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, pp. 220\u2013231 (2015)","DOI":"10.1109\/LICS.2015.30"},{"key":"23_CR37","unstructured":"Tsukada, T., Ong, C.-H.L.: Plays as resource terms via non-idempotent intersection types. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, USA, July 5\u20138, 2016, pp. 237\u2013246. ACM (2016)"},{"issue":"19","key":"23_CR38","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1016\/j.tcs.2010.01.024","volume":"411","author":"D Varacca","year":"2010","unstructured":"Varacca, D., Yoshida, N.: Typed event structures and the linear pi-calculus. Theor. Comput. Sci. 411(19), 1949\u20131973 (2010)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54458-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T21:23:05Z","timestamp":1750108985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54458-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662544570","9783662544587"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54458-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}