{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:39Z","timestamp":1725560319406},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_8","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"51-65","source":"Crossref","is-referenced-by-count":19,"title":["A Game Semantics of the Asynchronous \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Jim","family":"Laird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic\u00a059, 543\u2013574 (1994)","journal-title":"Journal of Symbolic Logic"},{"key":"8_CR2","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. Information and Computation\u00a0163, 409\u2013470 (2000)","journal-title":"Information and Computation"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-45413-6_7","volume-title":"Proceedings of TLCA 2001","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, p. 29. Springer, Heidelberg (2001)"},{"key":"8_CR4","volume-title":"Proceedings of LICS 2001","author":"M. Berger","year":"2001","unstructured":"Berger, M., Honda, K., Yoshida, N.: Strong normalization in the \u03c0-calculus. In: Proceedings of LICS 2001. IEEE Press, Los Alamitos (2001)"},{"key":"8_CR5","unstructured":"Boudol, G.: Asynchrony in the pi-calculus. Technical Report 1702, INRIA (1992)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ghica, D., McCusker, G.: The regular language semantics of second-order Idealised Algol. Theoretical Computer Science (2003) (to appear)","DOI":"10.1016\/S0304-3975(03)00315-3"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-3-540-24727-2_16","volume-title":"Proceedings of FOSSACS 2004","author":"D. Ghica","year":"2004","unstructured":"Ghica, D., Murawski, A.: Angelic semantics of fine-grained concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"8_CR8","volume-title":"Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999","author":"R. Harmer","year":"1998","unstructured":"Harmer, R., McCusker, G.: A fully abstract games semantics for finite nondeterminism. In: Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, LICS 1999. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"8_CR9","unstructured":"Hennessy, M.: A fully abstract denotational semantics for the \u03c0-calculus. Technical Report 041996, University of Sussex (COGS) (2996)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"Proceedings of ECOOP 1991","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":"8_CR11","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation\u00a0163, 285\u2013408 (2000)","journal-title":"Information and Computation"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1995)"},{"key":"8_CR13","unstructured":"Jeffrey, A.S.A., Rathke, J.: Contextual equivalence for higher-order pi-calculus revisited. Technical Report 0402, University of Sussex (COGS) (2002)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Jeffrey, A.S.A., Rathke, J.: A fully abstract may-testing semantics for concurrent objects. In: Proceedings of LICS 2002, pp. 101\u2013112 (2002)","DOI":"10.1109\/LICS.2002.1029820"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Camb. Phil. Soc.\u00a0119, 447\u2013468 (1996)","journal-title":"Math. Proc. Camb. Phil. Soc."},{"key":"8_CR16","series-title":"Electronic notes in Theoretical Computer Science","volume-title":"Proceedings of MFPS XVII","author":"J. Laird","year":"2001","unstructured":"Laird, J.: A game semantics of ICSP. In: Proceedings of MFPS XVII. Electronic notes in Theoretical Computer Science, vol.\u00a045. Elsevier, Amsterdam (2001)"},{"key":"8_CR17","series-title":"ENTCS","volume-title":"Proceedings of CTCS 2002","author":"J. Laird","year":"2002","unstructured":"Laird, J.: A categorical semantics of higher-order store. In: Proceedings of CTCS 2002. ENTCS, vol.\u00a069. Elsevier, Amsterdam (2002)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-24727-2_21","volume-title":"Foundations of Software Science and Computation Structures","author":"J. Laird","year":"2004","unstructured":"Laird, J.: A game semantics of local names and good variables. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 289\u2013303. Springer, Heidelberg (2004)"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/inco.2001.3080","volume":"172","author":"R. Nicola de","year":"2002","unstructured":"de Nicola, R., Boreale, M., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation\u00a0172(2), 139\u2013164 (2002)","journal-title":"Information and Computation"},{"key":"8_CR20","unstructured":"Moggi, E., Fiore, M., Sangiorgi, D.: A fully abstract model for the \u03c0-calculus. In: Proceedings of LICS 1996 (1996)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Hankin, C.: Generalised flowcharts and games. In: Proceedings of the 25th International Colloquium on Automata, Langugages and Programming (1998)","DOI":"10.1007\/BFb0055067"},{"key":"8_CR22","unstructured":"McCusker, G.: Games and full abstraction for a functional metalanguage with recursive types. PhD thesis, Imperial College London, Published by Cambridge University Press (1996)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R.: Polyadic \u03c0-calculus: a tutorial. In: Proceedings of the Marktoberdorf Summer School on Logic and Algebra of Specification (1992)","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-48523-6_59","volume-title":"Automata, Languages and Programming","author":"J. Power","year":"1999","unstructured":"Power, J., Thielecke, H.: Environments in Freyd categories and k-categories. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, p. 625. Springer, Heidelberg (1999)"},{"key":"8_CR25","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh (1993)"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Stark, I.: A fully abstract domain model for the \u03c0-calculus. In: Proceedings of LICS 1996 (1996)","DOI":"10.1109\/LICS.1996.561301"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:43:11Z","timestamp":1586472191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11539452_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}