{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:16Z","timestamp":1760079316712},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744061"},{"type":"electronic","value":"9783540744078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74407-8_27","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T10:30:48Z","timestamp":1187433048000},"page":"395-411","source":"Crossref","is-referenced-by-count":30,"title":["Asynchronous Games: Innocence Without Alternation"],"prefix":"10.1007","author":[{"given":"Paul-Andr\u00e9","family":"Melli\u00e8s","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Mimram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Sequentiality vs. concurrency in games and logic. In: MSCS (2003)","DOI":"10.1017\/S0960129503003980"},{"issue":"2","key":"27_CR2","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. The Journal of Symbolic Logic\u00a059(2), 543\u2013574 (1994)","journal-title":"The Journal of Symbolic Logic"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Melli\u00e8s, P.-A.: Concurrent games and full completeness. In: LICS (1999)","DOI":"10.1109\/LICS.1999.782638"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Baillot, P., Danos, V., Ehrhard, T., Regnier, L.: Timeless Games. In: CSL (1997)","DOI":"10.1007\/BFb0028007"},{"key":"27_CR5","unstructured":"Bednarczyk, M.A.: Categories of asynchronous systems. PhD thesis (1988)"},{"key":"27_CR6","unstructured":"Berry, G.: Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s. Th\u00e8se de Doctorat d\u2019\u00c9tat, Universit\u00e9 Paris VII (1979)"},{"issue":"1-2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0304-3975(96)00012-6","volume":"174","author":"F. Bracho","year":"1997","unstructured":"Bracho, F., Droste, M., Kuske, D.: Representation of computations in concurrent automata by dependence orders. Theoretical Computer Science\u00a0174(1-2), 67\u201396 (1997)","journal-title":"Theoretical Computer Science"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Clerbout, M., Latteux, M., Roos, Y.: The book of traces, ch. 12, pp. 487\u2013552 (1995)","DOI":"10.1142\/9789814261456_0012"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Curien, P.L., Faggian, C.: L-Nets, Strategies and Proof-Nets. In: CSL (2005)","DOI":"10.1007\/11538363_13"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01622878","volume":"28","author":"V. Danos","year":"1989","unstructured":"Danos, V., Regnier, L.: The structure of multiplicatives. Archive for Mathematical Logic\u00a028(3), 181\u2013203 (1989)","journal-title":"Archive for Mathematical Logic"},{"key":"27_CR11","unstructured":"Droste, M., Kuske, D.: Automata with concurrency relations \u2013 a survey. Advances in Logic, Artificial Intelligence and Robotics, pp. 152\u2013172 (2002)"},{"key":"27_CR12","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":"Foundations of Software Science and Computation Structures","author":"D.R. Ghica","year":"2004","unstructured":"Ghica, D.R., Murawski, A.S.: Angelic Semantics of Fine-Grained Concurrency. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 211\u2013225. Springer, Heidelberg (2004)"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. TCS\u00a050, 1\u2013102 (1987)","journal-title":"TCS"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Gonthier, G., L\u00e9vy, J.-J., Melli\u00e8s, P.-A.: An abstract standardisation theorem. In: LICS (1992)","DOI":"10.1109\/LICS.1992.185521"},{"issue":"4","key":"27_CR15","first-page":"411","volume":"10","author":"\u00c9. Goubault","year":"2000","unstructured":"Goubault, \u00c9.: Geometry and Concurrency: A User\u2019s Guide. MSCS\u00a010(4), 411\u2013425 (2000)","journal-title":"MSCS"},{"issue":"4","key":"27_CR16","first-page":"46","volume":"1","author":"A. Joyal","year":"1977","unstructured":"Joyal, A.: Remarques sur la theorie des jeux \u00e0 deux personnes. Gazette des Sciences Math\u00e9matiques du Quebec\u00a01(4), 46\u201352 (1977)","journal-title":"Gazette des Sciences Math\u00e9matiques du Quebec"},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_8","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"J. Laird","year":"2005","unstructured":"Laird, J.: A game semantics of the asynchronous \u03c0-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, Springer, Heidelberg (2005)"},{"key":"27_CR18","first-page":"554","volume-title":"LNCS","author":"P.-A. Melli\u00e8s","year":"1992","unstructured":"Melli\u00e8s, P.-A.: Axiomatic Rewriting\u00a01: A diagrammatic standardization theorem. In: LNCS, pp. 554\u2013638. Springer, Heidelberg (1992)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Axiomatic rewriting 4: A stability theorem in rewriting theory. In: LICS (1998)","DOI":"10.1007\/BFb0026981"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2004 - Concurrency Theory","author":"P.-A. Melli\u00e8s","year":"2004","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games\u00a02: the true concurrency of innocence. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, Springer, Heidelberg (2004)"},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M. Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part I. Theoretical Computer Science\u00a013, 85\u2013108 (1981)","journal-title":"Theoretical Computer Science"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0032041","volume-title":"Automata, Languages and Programming","author":"P. Panangaden","year":"1990","unstructured":"Panangaden, P., Shanbhogue, V., Stark, E.W.: Stability and sequentiality in data flow networks. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0443, pp. 253\u2013264. Springer, Heidelberg (1990)"},{"issue":"1","key":"27_CR23","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0304-3975(96)80710-9","volume":"170","author":"V. Sassone","year":"1996","unstructured":"Sassone, V., Nielsen, M., Winskel, G.: Models for concurrency: Towards a classification. Theoretical Computer Science\u00a0170(1), 297\u2013348 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"27_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","volume":"28","author":"M.W. Shields","year":"1985","unstructured":"Shields, M.W.: Concurrent Machines. The Computer Journal\u00a028(5), 449\u2013465 (1985)","journal-title":"The Computer Journal"},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"Varacca, D., Yoshida, N.: Typed Event Structures and the \u03c0-calculus. In: MFPS (2006)","DOI":"10.1016\/j.entcs.2006.04.019"},{"key":"27_CR26","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G. Winskel","year":"1995","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013148. Oxford University Press, Oxford (1995)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2007 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74407-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T16:57:51Z","timestamp":1683997071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74407-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744061","9783540744078"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74407-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}