{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:21Z","timestamp":1760202741589,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,10,17]],"date-time":"2017-10-17T00:00:00Z","timestamp":1508198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00236-017-0306-5","type":"journal-article","created":{"date-parts":[[2017,10,17]],"date-time":"2017-10-17T05:49:20Z","timestamp":1508219360000},"page":"669-701","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hierarchical information and the synthesis of distributed strategies"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9206-2644","authenticated-orcid":false,"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[]},{"given":"Anup Basil","family":"Mathew","sequence":"additional","affiliation":[]},{"given":"Marie","family":"van den Bogaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"key":"306_CR1","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"S Azhar","year":"2001","unstructured":"Azhar, S., Peterson, G., Reif, J.: Lower bounds for multiplayer non-cooperative games of incomplete information. J. Comput. Math. Appl. 41, 957\u2013992 (2001)","journal-title":"J. Comput. Math. Appl."},{"key":"306_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality of transducers. In: Proceedings of LATIN\u00a02000: Latin American Symposium on Theoretical Informatics, vol. 1776 of LNCS, pp. 397\u2013406. Springer (2000)","DOI":"10.1007\/10719839_39"},{"key":"306_CR3","unstructured":"Berwanger, D., Doyen, L.: On the power of imperfect information. In: Proceedings of FSTTCS 2008: Foundations of Software Technology and Theoretical Computer Science, vol. 2 of LIPIcs. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2008)"},{"issue":"4","key":"306_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10849-009-9115-8","volume":"19","author":"D Berwanger","year":"2010","unstructured":"Berwanger, D., Kaiser, L.: Information tracking in games on graphs. J. Log. Lang. Inf. 19(4), 395\u2013412 (2010)","journal-title":"J. Log. Lang. Inf."},{"key":"306_CR5","unstructured":"Berwanger, D., Kaiser, L., Puchala, B.: Perfect-information construction for coordination in games. In: Proceedings of FSTTCS 2011: Foundations of Software Technology and Theoretical Computer Science, vol. 13 of LIPIcs, pp. 387\u2013398. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"306_CR6","doi-asserted-by":"crossref","unstructured":"Berwanger, D., Mathew, A.B., Van den Bogaard, M.: Hierarchical information patterns and distributed strategy synthesis. In: Proceedings of ATVA 2015: Automated Technology for Verification and Analysis, vol. 9364 of LNCS, pp. 378\u2013393. Springer (2015)","DOI":"10.1007\/978-3-319-24953-7_28"},{"key":"306_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"JR B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Am. Math. Soc. 138, 295\u2013311 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"306_CR8","doi-asserted-by":"crossref","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proceedings of LICS 2005: Logic in Computer Science, pp. 321\u2013330. IEEE (2005)","DOI":"10.1109\/LICS.2005.53"},{"issue":"3","key":"306_CR9","doi-asserted-by":"crossref","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. Form. Methods Syst. Des. 34(3), 215\u2013237 (2009)","journal-title":"Form. Methods Syst. Des."},{"key":"306_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games, vol. 2500 of LNCS. Springer (2002)","DOI":"10.1007\/3-540-36387-4"},{"issue":"1","key":"306_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-0000(89)90039-1","volume":"38","author":"JY Halpern","year":"1989","unstructured":"Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time. I. Lower bounds. J. Comput. Syst. Sci. 38(1), 195\u2013237 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"306_CR12","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935\u2013938 (1988)","journal-title":"SIAM J. Comput."},{"key":"306_CR13","doi-asserted-by":"crossref","unstructured":"Janin, D.: On the (high) undecidability of distributed synthesis problems. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, vol. 4362 of LNCS, pp. 320\u2013329. Springer (2007)","DOI":"10.1007\/978-3-540-69507-3_26"},{"issue":"1","key":"306_CR14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"ND Jones","year":"1975","unstructured":"Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68\u201385 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"306_CR15","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: Proceedings of LICS\u00a02001: Logic in Computer Science, pp. 389\u2013398. IEEE Computer Society Press (2001)","DOI":"10.1109\/LICS.2001.932514"},{"key":"306_CR16","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Thiagarajan, P.S.: Distributed controller synthesis for local specifications. In: Proceedings of ICALP\u00a02001: Internatonial Colloquium on Automata, Languages and Programming, vol. 2076 of LNCS, pp. 396\u2013407. Springer (2001)","DOI":"10.1007\/3-540-48224-5_33"},{"key":"306_CR17","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Thiagarajan, P.S.: A decidable class of asynchronous distributed controllers. In: Proceedings of CONCUR 2002: Concurrency Theory, vol. 2421 of LNCS, pp. 145\u2013160. Springer. ISBN 978-3-540-44043-7 (2002)","DOI":"10.1007\/3-540-45694-5_11"},{"key":"306_CR18","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of SWAT 1972: Symposium on Switching and Automata Theory, pp. 125\u2013129. IEEE Computer Society Press (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"306_CR19","doi-asserted-by":"crossref","unstructured":"Mohalik, S., Walukiewicz, I.: Distributed games. In: Proceedings of FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, vol. 2014 of LNCS, pp. 338\u2013351. Springer (2003)","DOI":"10.1007\/978-3-540-24597-1_29"},{"key":"306_CR20","doi-asserted-by":"crossref","unstructured":"Moses, Y.: Relating knowledge and coordinated action: the knowledge of preconditions principle. In: Proceedings of TARK 2015: Theoretical Aspects of Rationality and Knowledge, vol. 215 of EPTCS, pp. 231\u2013245 (2015)","DOI":"10.4204\/EPTCS.215.17"},{"key":"306_CR21","unstructured":"Muscholl, A., Walukiewicz, I.: Distributed synthesis for acyclic architectures. In: Proceedings of FSTTCS 2014: Foundation of Software Technology and Theoretical Computer Science, vol. 29 of LIPIcs, pp. 639\u2013651. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"306_CR22","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: Proceedings of FOCS 1979: Symposium on Foundations of Computer Science, pp. 348\u2013363. IEEE (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"306_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of FOCS\u00a01990: Symposium on Foundations of Computer Science, pp. 746\u2013757. IEEE Computer Society Press (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"306_CR24","unstructured":"Puchala, B: Synthesis of winning strategies for interaction under partial information. Ph.D. dissertation, RWTH Aachen University (2013)"},{"key":"306_CR25","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/013","volume-title":"Automata on Infinite Objects and Church\u2019s Thesis, Regional Conference Series in Mathematics","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Church\u2019s Thesis, Regional Conference Series in Mathematics. American Mathematical Society, Providence (1972)"},{"key":"306_CR26","unstructured":"Schewe, S.: Synthesis of distributed systems. Ph.D. dissertation, Universit\u00e4t des Saarlandes (2008)"},{"issue":"3","key":"306_CR27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R Szelepcs\u00e9nyi","year":"1988","unstructured":"Szelepcs\u00e9nyi, R.: The method of forced enumeration for nondeterministic automata. Acta Inf. 26(3), 279\u2013284 (1988)","journal-title":"Acta Inf."},{"key":"306_CR28","doi-asserted-by":"crossref","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Proceedings of STACS 1995: Symposium on Theoretical Aspects of Computer Science, pp. 1\u201313 (1995)","DOI":"10.1007\/3-540-59042-0_57"},{"key":"306_CR29","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R., Ploeger, B.: Five determinisation algorithms. In: Proceedings of CIAA 2008: Conference on Implementation and Applications of Automata, pp. 161\u2013170. Springer (2008)","DOI":"10.1007\/978-3-540-70844-5_17"},{"issue":"2","key":"306_CR30","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1006\/inco.1995.1071","volume":"118","author":"A Weber","year":"1995","unstructured":"Weber, A., Klemm, R.: Economy of description for single-valued transducers. Inf. Comput. 118(2), 327\u2013340 (1995)","journal-title":"Inf. Comput."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-017-0306-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0306-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0306-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T14:41:06Z","timestamp":1750948866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-017-0306-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,17]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["306"],"URL":"https:\/\/doi.org\/10.1007\/s00236-017-0306-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2017,10,17]]}}}