{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:11:27Z","timestamp":1751602287647,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_1","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T23:52:34Z","timestamp":1523663554000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Non-angelic Concurrent Game Semantics"],"prefix":"10.1007","author":[{"given":"Simon","family":"Castellan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Clairambault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Hayman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0029944","volume-title":"Mathematical Foundations of Computer Science 1997","author":"S Abramsky","year":"1997","unstructured":"Abramsky, S.: Game semantics for programming languages. In: Pr\u00edvara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol. 1295, pp. 1\u20134. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0029944"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR 1995: Concurrency Theory","author":"E Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 313\u2013327. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60218-6_23"},{"key":"1_CR3","unstructured":"Castellan, S.: Concurrent structures in game semantics. Ph.D. thesis, ENS Lyon, France (2017)"},{"key":"1_CR4","unstructured":"Castellan, S., Clairambault, P.: Causality vs. interleaving in game semantics. In: CONCUR 2016 - Concurrency Theory (2016)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Castellan, S., Clairambault, P., Rideau, S., Winskel, G.: Games and strategies as event structures. Log. Methods Comput. Sci. 13 (2017)","DOI":"10.23638\/LMCS-13(3:35)2017"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Castellan, S., Clairambault, P., Winskel, G.: Symmetry in concurrent games. In: Henzinger, T.A., Miller, D. (eds.) CSL-LICS 2014, Vienna, Austria, July 14\u201318, 2014, p. 28. ACM (2014)","DOI":"10.1145\/2603088.2603141"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Castellan, S., Clairambault, P., Winskel, G.: The parallel intensionally fully abstract games model of PCF. In: LICS 2015. IEEE Computer Society (2015)","DOI":"10.1109\/LICS.2015.31"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.entcs.2014.10.006","volume":"308","author":"S Castellan","year":"2014","unstructured":"Castellan, S., Hayman, J., Lasson, M., Winskel, G.: Strategies as concurrent processes. Electr. Notes Theor. Comput. Sci. 308, 87\u2013107 (2014)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Danos, V., Harmer, R.: Probabilistic game semantics. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, 26\u201329 June 2000, pp. 204\u2013213 (2000)","DOI":"10.1109\/LICS.2000.855770"},{"issue":"2\u20133","key":"1_CR10","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. Log. 151(2\u20133), 89\u2013114 (2008)","journal-title":"Ann. Pure Appl. Log."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, 2\u20135 July 1999, pp. 422\u2013430 (1999)","DOI":"10.1109\/LICS.1999.782637"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-40206-7_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"T Hirschowitz","year":"2013","unstructured":"Hirschowitz, T.: Full abstraction for fair testing in CCS. In: Heckel, R., Milius, S. (eds.) CALCO 2013. LNCS, vol. 8089, pp. 175\u2013190. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40206-7_14"},{"key":"1_CR13","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":"1_CR14","doi-asserted-by":"crossref","unstructured":"Rideau, S., Winskel, G.: Concurrent strategies. In: LICS, pp. 409\u2013418. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.13"},{"key":"1_CR15","unstructured":"Tsukada, T., Luke Ong, C.-H.: Innocent strategies are sheaves over plays - deterministic, non-deterministic and probabilistic innocence. CoRR, abs\/1409.2764 (2014)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Tsukada, T., Luke Ong, C.-H.: Nondeterminism in game semantics via sheaves. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6\u201310 July 2015, pp. 220\u2013231 (2015)","DOI":"10.1109\/LICS.2015.30"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-17906-2_31","volume-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","author":"G Winskel","year":"1987","unstructured":"Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 255, pp. 325\u2013392. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17906-2_31"},{"key":"1_CR18","unstructured":"Yamada, N., Abramsky, S.: Dynamic games and strategies. CoRR, abs\/1601.04147 (2016)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:34:21Z","timestamp":1751564061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}