{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T11:46:11Z","timestamp":1773834371512,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,9,29]],"date-time":"2017-09-29T00:00:00Z","timestamp":1506643200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,29]],"date-time":"2017-09-29T00:00:00Z","timestamp":1506643200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2017,9,29]],"date-time":"2017-09-29T00:00:00Z","timestamp":1506643200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["267916"],"award-info":[{"award-number":["267916"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-10-LABX-0070"],"award-info":[{"award-number":["ANR-10-LABX-0070"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau and Winskel: a notion of pre-strategy based on event structures; a characterisation of those pre-strategies (deemed strategies) which are preserved by composition with a copycat strategy; and the construction of a bicategory of these strategies. Furthermore, we prove that the corresponding category has a compact closed structure, and hence forms the basis for the semantics of concurrent higher-order computation.<\/jats:p>","DOI":"10.23638\/lmcs-13(3:35)2017","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:20Z","timestamp":1743701660000},"source":"Crossref","is-referenced-by-count":5,"title":["Games and Strategies as Event Structures"],"prefix":"10.23638","volume":"Volume 13, Issue 3","author":[{"given":"Simon","family":"Castellan","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Clairambault","sequence":"additional","affiliation":[]},{"given":"Silvain","family":"Rideau","sequence":"additional","affiliation":[]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2017,9,29]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1604.04390v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1604.04390v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:34:21Z","timestamp":1743701661000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/3966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-13(3:35)2017","relation":{"is-same-as":[{"id-type":"arxiv","id":"1604.04390","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1604.04390","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,29]]},"article-number":"3966"}}