{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:36Z","timestamp":1776316836028,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642392115","type":"print"},{"value":"9783642392122","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_26","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"275-286","source":"Crossref","is-referenced-by-count":19,"title":["Asynchronous Games over Tree Architectures"],"prefix":"10.1007","author":[{"given":"Blaise","family":"Genest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Gimbert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-00596-1_29","volume-title":"Foundations of Software Science and Computational Structures","author":"B. Bollig","year":"2009","unstructured":"Bollig, B., Grindei, M.-L., Habermehl, P.: Realizability of concurrent recursive programs. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 410\u2013424. Springer, Heidelberg (2009)"},{"key":"26_CR2","unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proceedings of the International Congress of Mathematicians, pp. 23\u201335 (1962)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Clairambault, P., Gutierrez, J., Winskel, G.: The winning ways of concurrent games. In: LICS, pp. 235\u2013244. IEEE (2012)","DOI":"10.1109\/LICS.2012.34"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific (1995)","DOI":"10.1142\/9789814261456"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: LICS, pp. 321\u2013330. IEEE (2005)","DOI":"10.1007\/11562948_21"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-30538-5_23","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"P. Gastin","year":"2004","unstructured":"Gastin, P., Lerman, B., Zeitoun, M.: Distributed games with causal memory are decidable for series-parallel systems. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 275\u2013286. Springer, Heidelberg (2004)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10703-008-0064-7","volume":"34","author":"P. Gastin","year":"2009","unstructured":"Gastin, P., Sznajder, N., Zeitoun, M.: Distributed synthesis for well-connected architectures. Formal Methods in System Design\u00a034(3), 215\u2013237 (2009)","journal-title":"Formal Methods in System Design"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-14162-1_5","volume-title":"Automata, Languages and Programming","author":"B. Genest","year":"2010","unstructured":"Genest, B., Gimbert, H., Muscholl, A., Walukiewicz, I.: Optimal Zielonka-type construction of deterministic asynchronous automata. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 52\u201363. Springer, Heidelberg (2010)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-642-22110-1_41","volume-title":"Computer Aided Verification","author":"G. Katz","year":"2011","unstructured":"Katz, G., Peled, D., Schewe, S.: Synthesis of distributed control through knowledge accumulation. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol.\u00a06806, pp. 510\u2013525. Springer, Heidelberg (2011)"},{"key":"26_CR10","unstructured":"Kupferman, O., Vardi, M.: Synthesizing distributed systems. In: LICS (2001)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-48224-5_33","volume-title":"Automata, Languages and Programming","author":"P. Madhusudan","year":"2001","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, p. 396. Springer, Heidelberg (2001)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11590156_16","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"P. Madhusudan","year":"2005","unstructured":"Madhusudan, P., Thiagarajan, P.S., Yang, S.: The MSO theory of connectedly communicating processes. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 201\u2013212. Springer, Heidelberg (2005)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB\u00a078, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"issue":"2-3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.01.016","volume":"358","author":"P.-A. Melli\u00e8s","year":"2006","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 2: The true concurrency of innocence. TCS\u00a0358(2-3), 200\u2013228 (2006)","journal-title":"TCS"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/11539452_42","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Meyden van der","year":"2005","unstructured":"van der Meyden, R., Wilke, T.: Synthesis of distributed systems from knowledge-based specifications. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 562\u2013576. Springer, Heidelberg (2005)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming","author":"A. Pnueli","year":"1989","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 652\u2013671. Springer, Heidelberg (1989)"},{"key":"26_CR17","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: FOCS, pp. 746\u2013757 (1990)"},{"issue":"2","key":"26_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J.G. Ramadge","year":"1989","unstructured":"Ramadge, P.J.G., Wonham, W.M.: The control of discrete event systems. Proceedings of the IEEE\u00a077(2), 81\u201398 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-71410-1_10","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S. Schewe","year":"2007","unstructured":"Schewe, S., Finkbeiner, B.: Synthesis of asynchronous systems. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol.\u00a04407, pp. 127\u2013142. Springer, Heidelberg (2007)"},{"key":"26_CR20","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. RAIRO\u2013Theoretical Informatics and Applications\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO\u2013Theoretical Informatics and Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,27]],"date-time":"2022-02-27T01:16:23Z","timestamp":1645924583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}