{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:40:20Z","timestamp":1737290420280,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_26","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:35:58Z","timestamp":1184607358000},"page":"320-329","source":"Crossref","is-referenced-by-count":8,"title":["On the (High) Undecidability of Distributed Synthesis Problems"],"prefix":"10.1007","author":[{"given":"David","family":"Janin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"1","volume":"66","author":"R. Berger","year":"1966","unstructured":"Berger, R.: The Undecidability of the Dominoe Problem. Memoirs of the American Mathematical Society\u00a066, 1\u201372 (1966)","journal-title":"Memoirs of the American Mathematical Society"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1007\/11537311_47","volume-title":"Fundamentals of Computation Theory","author":"J. Bernet","year":"2005","unstructured":"Bernet, J., Janin, D.: Tree Automata and Discrete Distributed Games. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 540\u2013551. Springer, Heidelberg (2005)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM\u00a028, 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/4904.4993","volume":"33","author":"D. Harel","year":"1986","unstructured":"Harel, D.: Effective Transformations on Infinite Trees, with Applications to High Undecidability. J. ACM\u00a033(1), 224\u2013248 (1986)","journal-title":"J. ACM"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Synthesizing Distributed Systems. In: IEEE Symp. on Logic in Computer Science (LICS), pp. 389\u2013398 (2001)","DOI":"10.1109\/LICS.2001.932514"},{"key":"26_CR7","unstructured":"Madhusudan, P.: Control and Synthesis of Open Reactive Systems. PhD Thesis, University of Madras (2001)"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a02914, pp. 338\u2013351. Springer, Heidelberg (2003)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A.W. Mostowski","year":"1991","unstructured":"Mostowski, A.W.: Hierarchies of Weak Automata on Weak Monadic Formulas. Theoretical Comp. Science\u00a083, 323\u2013335 (1991)","journal-title":"Theoretical Comp. Science"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-Person Alternation. In: 20th\u00a0Annual IEEE Symposium on Foundations of Computer Sciences, October 1979, pp. 348\u2013363 (1979)","DOI":"10.1109\/SFCS.1979.25"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: Distributed Reactive Systems are Hard to Synthesize. In: IEEE Symposium on Foundations of Computer Science, pp. 746\u2013757 (1990)","DOI":"10.1109\/FSCS.1990.89597"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of Second Order Theories and Automata on Infinite Trees. Trans. Amer. Math. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:20:37Z","timestamp":1737289237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}