{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:29:49Z","timestamp":1768908589930,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642548291","type":"print"},{"value":"9783642548307","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_15","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:30:31Z","timestamp":1395408631000},"page":"226-241","source":"Crossref","is-referenced-by-count":4,"title":["Latticed-LTL Synthesis in the Presence of Noisy Inputs"],"prefix":"10.1007","author":[{"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-39212-2_3","volume-title":"Automata, Languages, and Programming","author":"S. Almagor","year":"2013","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 15\u201327. Springer, Heidelberg (2013)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-70545-1_23","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2008","unstructured":"Alur, R., Kanade, A., Weiss, G.: Ranking automata and games for prioritized requirements. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 240\u2013253. Springer, Heidelberg (2008)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R. Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 140\u2013156. Springer, Heidelberg (2009)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cern\u00fd, P., Henzinger, T.: From boolean to quantitative synthesis. In: EMSOFT, pp. 149\u2013154 (2011)","DOI":"10.1145\/2038642.2038666"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-540-87531-4_28","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 385\u2013400. Springer, Heidelberg (2008)"},{"key":"15_CR6","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":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-24310-3_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"K. Chatterjee","year":"2011","unstructured":"Chatterjee, K., Majumdar, R.: Minimum attention controller synthesis for omega-regular objectives. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 145\u2013159. Springer, Heidelberg (2011)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-78929-1_6","volume-title":"Hybrid Systems: Computation and Control","author":"K. Chatterjee","year":"2008","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Controller synthesis with budget constraints. In: Egerstedt, M., Mishra, B. (eds.) HSCC 2008. LNCS, vol.\u00a04981, pp. 72\u201386. Springer, Heidelberg (2008)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45139-0_3","volume-title":"Model Checking Software","author":"M. Chechik","year":"2001","unstructured":"Chechik, M., Devereux, B., Gurfinkel, A.: Model-checking infinite state-space systems with fine-grained abstractions using SPIN. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol.\u00a02057, pp. 16\u201336. Springer, Heidelberg (2001)"},{"key":"15_CR10","unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proc. Int. Congress of Mathematicians, pp. 23\u201335 (1962); (Institut Mittag-Leffler, 1963)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: Tree automata, \u03bc-calculus and determinacy. In: Proc. 32nd FOCS, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.entcs.2008.11.019","volume":"220","author":"M. Faella","year":"2008","unstructured":"Faella, M., Legay, A., Stoelinga, M.: Model checking quantitative linear time logic. Electr. Notes Theor. Comput. Sci.\u00a0220(3), 61\u201377 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-02658-4_22","volume-title":"Computer Aided Verification","author":"E. Filiot","year":"2009","unstructured":"Filiot, E., Jin, N., Raskin, J.-F.: An antichain algorithm for LTL realizability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 263\u2013277. Springer, Heidelberg (2009)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.entcs.2004.08.003","volume":"73","author":"M. Huth","year":"2004","unstructured":"Huth, M., Pradhan, S.: Consistent partial model checking. Electr. Notes Theor. Comput. Sci.\u00a073, 45\u201385 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1137\/070686652","volume":"38","author":"M. Jurdzinski","year":"2008","unstructured":"Jurdzinski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. SIAM Journal on Computing\u00a038(4), 1519\u20131532 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1142\/S0129054110007192","volume":"21","author":"O. Kupferman","year":"2010","unstructured":"Kupferman, O., Lustig, Y.: Latticed simulation relations and games. International Journal on the Foundations of Computer Science\u00a021(2), 167\u2013189 (2010)","journal-title":"International Journal on the Foundations of Computer Science"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O. Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.: Church\u2019s problem revisited. The Bulletin of Symbolic Logic\u00a05(2), 245\u2013263 (1999)","journal-title":"The Bulletin of Symbolic Logic"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.: Safraless decision procedures. In: Proc. 46th FOCS, pp. 531\u2013540 (2005)","DOI":"10.1109\/SFCS.2005.66"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.: Quantitative verification: models techniques and tools. In: ESEC\/SIGSOFT FSE, pp. 449\u2013458 (2007)","DOI":"10.1145\/1295014.1295018"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"65","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel Determinacy. Annals of Mathematics\u00a065, 363\u2013371 (1975)","journal-title":"Annals of Mathematics"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on \u03c9-words. TCS\u00a032, 321\u2013330 (1984)","journal-title":"TCS"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proc. 21st LICS, pp. 255\u2013264. IEEE press (2006)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proc. 16th POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J. Reif","year":"1984","unstructured":"Reif, J.: The complexity of two-player games of incomplete information. Journal of Computer and Systems Science\u00a029, 274\u2013301 (1984)","journal-title":"Journal of Computer and Systems Science"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Safra, S.: Exponential Determinization for \u03c9-Automata with Strong-Fairness Acceptance Condition. In: Proc. 24th STOC, pp. 275\u2013282 (1992)","DOI":"10.1145\/129712.129739"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-77050-3_37","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S. Schewe","year":"2007","unstructured":"Schewe, S.: Solving Parity Games in Big Steps. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 449\u2013460. Springer, Heidelberg (2007)"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-87873-5_2","volume-title":"Verified Software: Theories, Tools, Experiments","author":"M.Y. Vardi","year":"2008","unstructured":"Vardi, M.Y.: From verification to synthesis. In: Shankar, N., Woodcock, J. (eds.) VSTTE 2008. LNCS, vol.\u00a05295, pp. 2\u20132. Springer, Heidelberg (2008)"},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M. Vardi","year":"1994","unstructured":"Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-19805-2_19","volume-title":"Foundations of Software Science and Computational Structures","author":"Y. Velner","year":"2011","unstructured":"Velner, Y., Rabinovich, A.: Church synthesis problem for noisy input. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 275\u2013289. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:46:51Z","timestamp":1746157611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}