{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:15Z","timestamp":1750306695204,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603141","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Symmetry in concurrent games"],"prefix":"10.1145","author":[{"given":"Simon","family":"Castellan","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Lyon, all\u00e9e d'Italie, Lyon, France"}]},{"given":"Pierre","family":"Clairambault","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, all\u00e9e d'Italie, Lyon, France"}]},{"given":"Glynn","family":"Winskel","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, UK"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"volume-title":"Springer","year":"2004","author":"Ghica D. R.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11691372_20"},{"volume-title":"IEEE Computer Society","year":"1999","author":"Abramsky S.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.016"},{"key":"e_1_3_2_1_6_1","first-page":"395","volume-title":"Eds.","volume":"4703","author":"Melli\u00e8s P.-A.","year":"2007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2011.13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2930"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.02.022"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0057"},{"key":"e_1_3_2_1_12_1","first-page":"68","volume-title":"IEEE Computer Society","author":"Baillot P.","year":"1997"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2917"},{"key":"e_1_3_2_1_14_1","unstructured":"P.-A. Melli\u00e8s \"Asynchronous games 1: A group-theoretic formulation of uniformity \" Manuscript Available online 2003.  P.-A. Melli\u00e8s \"Asynchronous games 1: A group-theoretic formulation of uniformity \" Manuscript Available online 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37075-5_27"},{"key":"e_1_3_2_1_16_1","unstructured":"A. Joyal \"Remarques sur la th\u00e9orie des jeux \u00e0 deux personnes \" Gazette des sciences math\u00e9matiques du Qu\u00e9bec 1(4) 1997.  A. Joyal \"Remarques sur la th\u00e9orie des jeux \u00e0 deux personnes \" Gazette des sciences math\u00e9matiques du Qu\u00e9bec 1(4) 1997."},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"Categorical semantics of linear logic","volume":"27","author":"Melli\u00e8s P.-A.","year":"2009","journal-title":"Panoramas et synth\u00e8ses"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02273-9_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-012-0235-6"},{"key":"e_1_3_2_1_22_1","unstructured":"R. Harmer Games and full abstraction for non-deterministic languages 1999 PhD thesis University of London.  R. Harmer Games and full abstraction for non-deterministic languages 1999 PhD thesis University of London."}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the 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)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603141","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:41Z","timestamp":1750230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":22,"alternative-id":["10.1145\/2603088.2603141","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603141","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}