{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:19Z","timestamp":1760202619051,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_19","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"275-289","source":"Crossref","is-referenced-by-count":13,"title":["Church Synthesis Problem for Noisy Input"],"prefix":"10.1007","author":[{"given":"Yaron","family":"Velner","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rabinovich","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-00596-1_24","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Alur","year":"2009","unstructured":"Alur, R., Degorre, A., Maler, O., Weiss, G.: On omega-languages defined by mean-payoff conditions. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 333\u2013347. Springer, Heidelberg (2009)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","volume":"310","author":"H. Bjorklund","year":"2004","unstructured":"Bjorklund, H., Sandberg, S., Vorobyov, S.: Memoryless determinacy of parity and mean payoff games: a simple proof. Theoretical Computer Science\u00a0310, 365\u2013378 (2004)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-14162-1_40","volume-title":"Automata, Languages and Programming","author":"T. Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jancar, P., Kucera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 478\u2013489. Springer, Heidelberg (2010)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"19_CR5","first-page":"178","volume-title":"Proc. of LICS","author":"K. Chatterjee","year":"2005","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean payoff parity games. In: Proc. of LICS, pp. 178\u2013187. IEEE Computer Society, Los Alamitos (2005)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-642-14162-1_50","volume-title":"Automata, Languages and Programming","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: Energy Parity Games. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 599\u2013610. Springer, Heidelberg (2010)"},{"key":"19_CR7","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Generalized mean payoff and Energy Games. To appear in Proc. of FSTTCS (2010)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-15375-4_19","volume-title":"CONCUR 2010 - Concurrency Theory","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T.A., Rannou, P.: Mean-Payoff Automaton Expressions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 269\u2013283. Springer, Heidelberg (2010)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/11874683_19","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games with imperfect information,. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 287\u2013302. Springer, Heidelberg (2006)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-15205-4_22","volume-title":"Computer Science Logic","author":"A. Degorre","year":"2010","unstructured":"Degorre, A., Doyen, L., Gentilini, R., Raskin, J.-F., Torunczyk, S.: Energy and Mean-Payoff Games with Imperfect Information. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol.\u00a06247, pp. 260\u2013274. Springer, Heidelberg (2010)"},{"key":"19_CR11","first-page":"109","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: International journal of game theory. Positional Strategies for Mean-Payoff Games\u00a08, 109\u2013113 (1979)","journal-title":"Positional Strategies for Mean-Payoff Games"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-12032-9_18","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Holtmann","year":"2010","unstructured":"Holtmann, M., Kaiser, L., Thomas, W.: Degrees of Lookahead in Regular\u00a0Infinite\u00a0Games. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 252\u2013266. Springer, Heidelberg (2010)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R., Sullivan, G.F.: Detecting cycles in dynamic graphs in polynomial time. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 398\u2013406 (1988)","DOI":"10.1145\/62212.62251"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR16","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier Science Pub., Amsterdam (1990)"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U. Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The Complexity of Mean Payoff Games on Graphs. Theoretical Computer Science\u00a0158, 343\u2013359 (1996)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:07:28Z","timestamp":1558422448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}