{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:05:19Z","timestamp":1748577919452,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_8","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"108-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Consensus Game Acceptors"],"prefix":"10.1007","author":[{"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[]},{"given":"Marie","family":"van den Bogaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49, 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"8_CR2","unstructured":"Arnold, A., Walukiewicz, I.: Nondeterministic controllers of nondeterministic processes. In: Logic and Automata, vol. 2. Amsterdam University Press (2007)"},{"key":"8_CR3","doi-asserted-by":"publisher","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. Journal of Computers and Mathematics with Applications 41, 957\u2013992 (2001)","journal-title":"Journal of Computers and Mathematics with Applications"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10849-009-9115-8","volume":"19","author":"D Berwanger","year":"2010","unstructured":"Berwanger, D., Kaiser, \u0141.: Information tracking in games on graphs. Journal of Logic, Language and Information 19, 395\u2013412 (2010)","journal-title":"Journal of Logic, Language and Information"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01705890","volume":"4","author":"RV Book","year":"1970","unstructured":"Book, R.V., Greibach, S.A.: Quasi-realtime languages. Mathematical Systems Theory 4, 97\u2013111 (1970)","journal-title":"Mathematical Systems Theory"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. Journal of the ACM 28, 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","volume":"32","author":"BS Chlebus","year":"1986","unstructured":"Chlebus, B.S.: Domino-tiling games. Journal of Computer and System Sciences 32, 374\u2013392 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems. Studies in Logic and the Foundations of Mathematics, vol. 35, pp. 118\u2013161. Elsevier (1963)","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press (1995)","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"8_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/b10581","volume-title":"Games, Puzzles, and Computation","author":"RA Hearn","year":"2009","unstructured":"Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. A. K. Peters Ltd., Natick (2009)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-69507-3_26","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"D Janin","year":"2007","unstructured":"Janin, D.: On the (high) undecidability of distributed synthesis problems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 320\u2013329. Springer, Heidelberg (2007)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S-Y Kuroda","year":"1964","unstructured":"Kuroda, S.-Y.: Classes of languages and linear-bounded automata. Information and Control 7, 207\u2013223 (1964)","journal-title":"Information and Control"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation 138, 160\u2013169 (1997)","journal-title":"Information and Computation"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(96)00283-6","volume":"178","author":"M Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Recognizable picture languages and domino tiling. Theoretical Computer Science 178, 275\u2013283 (1997)","journal-title":"Theoretical Computer Science"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0055778","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M Latteux","year":"1998","unstructured":"Latteux, M., Simplot, D., Terlutte, A.: Iterated length-preserving rational transductions. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 286\u2013295. Springer, Heidelberg (1998)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-24597-1_29","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"S Mohalik","year":"2003","unstructured":"Mohalik, S., Walukiewicz, I.: Distributed games. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 338\u2013351. Springer, Heidelberg (2003)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-31653-1_12","volume-title":"Developments in Language Theory","author":"A Okhotin","year":"2012","unstructured":"Okhotin, A.: Non-erasing variants of the Chomsky\u2013Sch\u00fctzenberger theorem. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 121\u2013129. Springer, Heidelberg (2012)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: Proc. 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 348\u2013363. IEEE (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, FoCS 1990, pp. 746\u2013757. IEEE Computer Society Press (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"8_CR21","volume-title":"Formal Languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ipl.2013.11.012","volume":"114","author":"S Schewe","year":"2014","unstructured":"Schewe, S.: Distributed synthesis is simply undecidable. Inf. Process. Lett. 114, 203\u2013207 (2014)","journal-title":"Inf. Process. Lett."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol. 18, pp. 331\u2013363. Marcel Dekker Inc. (1997)","DOI":"10.1201\/9780429187490-12"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T09:29:43Z","timestamp":1748510983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}