{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T21:57:34Z","timestamp":1775512654907,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T00:00:00Z","timestamp":1491436800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["278410"],"award-info":[{"award-number":["278410"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10626-017-0242-0","type":"journal-article","created":{"date-parts":[[2017,4,6]],"date-time":"2017-04-06T19:04:56Z","timestamp":1491505496000},"page":"547-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Latticed-LTL synthesis in the presence of noisy inputs"],"prefix":"10.1007","volume":"27","author":[{"given":"Shaull","family":"Almagor","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,6]]},"reference":[{"key":"242_CR1","doi-asserted-by":"crossref","unstructured":"Almagor S, Boker U, Kupferman O (2013) ForMalizing and reasoning about quality. In: Proceedings of the 40th int. Colloq. on automata, languages, and programming, volume 7966 of lecture notes in computer science, pp 15\u201327. Springer","DOI":"10.1007\/978-3-642-39212-2_3"},{"issue":"3","key":"242_CR2","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/2875421","volume":"63","author":"S Almagor","year":"2016","unstructured":"Almagor S, Boker U, Kupferman O (2016) Formally reasoning about quality. J ACM 63(3):24","journal-title":"J ACM"},{"key":"242_CR3","unstructured":"Almagor S, Kuperberg D, Kupferman O (2015) The sensing cost of monitoring and synthesis. In: 35th IARCS annual conference on foundation of software technology and theoretical computer science, FSTTCS 2015, december 16-18, 2015, Bangalore, India, pp 380\u2013393"},{"key":"242_CR4","doi-asserted-by":"crossref","unstructured":"Alur R, Kanade A, Weiss G (2008) Ranking automata and games for prioritized requirements. In: Proc. 20th int. Conf. on computer aided verification, volume 5123 of lecture notes in computer science, pp 240\u2013253. Springer","DOI":"10.1007\/978-3-540-70545-1_23"},{"key":"242_CR5","doi-asserted-by":"crossref","unstructured":"Baier C, Klein J, Kl\u00fcppelholz S, M\u00e4rcker S (2014) Computing conditional probabilities in markovian models efficiently. In: 20Th TACAS, pp 515\u2013530","DOI":"10.1007\/978-3-642-54862-8_43"},{"key":"242_CR6","doi-asserted-by":"crossref","unstructured":"Bloem R, Chatterjee K, Henzinger T, Jobstmann B (2009) Better quality in synthesis through quantitative objectives. In: Proc. 21st int. Conf. on computer aided verification, volume 5643 of lecture notes in computer science, pp 140\u2013156. Springer","DOI":"10.1007\/978-3-642-02658-4_14"},{"key":"242_CR7","unstructured":"Cern\u00fd P, Henzinger T (2011) From boolean to quantitative synthesis. In: EMSOFT, pp 149\u2013154"},{"key":"242_CR8","unstructured":"Chatterjee K, Doyen L, Henzinger T (2008) Quantative languages. In: Proceedings of the 17th annual conference of the european association for computer science logic, pp 385\u2013400"},{"key":"242_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee K, Doyen L, Henzinger TA, Raskin J-F (2006) Algorithms for omega-regular games with imperfect information. In: Proceedings of the 15th annual conference of the european association for computer science logic, volume 4207 of lecture notes in computer science, pp 287\u2013302","DOI":"10.1007\/11874683_19"},{"key":"242_CR10","unstructured":"Chatterjee K, Jurdzinski M, Henzinger TA (2004) Quantitative stochastic parity games. In: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp 121\u2013130"},{"key":"242_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee K, Majumdar R (2011) Minimum attention controller synthesis for omega-regular objectives FORMATS, pp 145\u2013159","DOI":"10.1007\/978-3-642-24310-3_11"},{"key":"242_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee K, Majumdar R, Henzinger TA (2008) Controller synthesis with budget constraints. In: Proceedings of the 11th international workshop on hybrid systems: computation and control, volume 4981 of lecture notes in computer science, pp 72\u201386. Springer","DOI":"10.1007\/978-3-540-78929-1_6"},{"key":"242_CR13","doi-asserted-by":"crossref","unstructured":"Chechik M, Devereux B, Gurfinkel A (2001) Model-checking infinite state-space systems with fine-grained abstractions using SPIN. In: Proceedings of the 8th international SPIN workshop on model checking software, volume 2057 of lecture notes in computer science, pp 16\u201336. Springer","DOI":"10.1007\/3-540-45139-0_3"},{"key":"242_CR14","unstructured":"Church A (1963) Logic, arithmetics, and automata. In: Proceedings of the international congress of mathematicians, 1962, pp 23\u201335. Institut Mittag-Leffler"},{"key":"242_CR15","doi-asserted-by":"crossref","unstructured":"Emerson E, Jutla C (1991) Tree automata, \u03bc-calculus and determinacy. In: Proceedings of the 32nd IEEE symposium on foundations of computer science, pp 368\u2013377","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"3","key":"242_CR16","doi-asserted-by":"crossref","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 (2008) Model checking quantitative linear time logic. Electr Notes Theor Comput Sci 220(3):61\u201377","journal-title":"Electr Notes Theor Comput Sci"},{"key":"242_CR17","doi-asserted-by":"crossref","unstructured":"Filiot E, Jin N, Raskin J-F (2009) An antichain algorithm for LTL realizability. In: Proceedings of the 21st international conference on computer aided verification, vol 5643, pp 263\u2013277","DOI":"10.1007\/978-3-642-02658-4_22"},{"key":"242_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.entcs.2004.08.003","volume":"73","author":"M Huth","year":"2004","unstructured":"Huth M, Pradhan S (2004) Consistent partial model checking. Electr Notes Theor Comput Sci 73:45\u201385","journal-title":"Electr Notes Theor Comput Sci"},{"issue":"4","key":"242_CR19","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1137\/070686652","volume":"38","author":"M Jurdzinski","year":"2008","unstructured":"Jurdzinski M, Paterson M, Zwick U (2008) A deterministic subexponential algorithm for solving parity games. SIAM J Comput 38(4):1519\u20131532","journal-title":"SIAM J Comput"},{"key":"242_CR20","unstructured":"Kumar R, Shayman M (1995) Supervisory control of nondeterministic systems under partial observation and decentralization. SIAM Journal of Control and Optimization"},{"key":"242_CR21","doi-asserted-by":"crossref","unstructured":"Kupferman O, Lustig Y (2007) Lattice automata. In: Proceedings of the 8th international conference on verification, model checking, and abstract interpretation, volume 4349 of lecture notes in computer science, pp 199\u2013213. Springer","DOI":"10.1007\/978-3-540-69738-1_14"},{"issue":"2","key":"242_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1142\/S0129054110007192","volume":"21","author":"O Kupferman","year":"2010","unstructured":"Kupferman O, Lustig Y (2010) Latticed simulation relations and games. Int J Found Comput Sci 21(2):167\u2013189","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"242_CR23","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/421091","volume":"5","author":"O Kupferman","year":"1999","unstructured":"Kupferman O, Vardi M (1999) Church\u2019s problem revisited. Bull Symb Log 5 (2):245\u2013263","journal-title":"Bull Symb Log"},{"key":"242_CR24","doi-asserted-by":"crossref","unstructured":"Kupferman O, Vardi M (2000) Synthesis with incomplete information. In: Advances in temporal logic, pp 109\u2013127. Kluwer Academic Publishers","DOI":"10.1007\/978-94-015-9586-5_6"},{"key":"242_CR25","doi-asserted-by":"crossref","unstructured":"Kupferman O, Vardi M (2005) Safraless decision procedures. In: Proceedings of the 46th IEEE symposium on foundations of computer science, pp 531\u2013540","DOI":"10.1109\/SFCS.2005.66"},{"key":"242_CR26","unstructured":"Kwiatkowska M (2007) Quantitative verification: models techniques and tools. In: ESEC\/SIGSOFT FSE, pp 449\u2013458"},{"key":"242_CR27","doi-asserted-by":"crossref","unstructured":"Majumdar R, Render E, Tabuada P (2011) Robust discrete synthesis against unspecified disturbances. In: Proceedings of the 14th ACM international conference on hybrid systems: computation and control, HSCC 2011, Chicago, IL, USA, April 12-14, 2011, pp 211\u2013220","DOI":"10.1145\/1967701.1967732"},{"key":"242_CR28","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","volume":"65","author":"D Martin","year":"1975","unstructured":"Martin D (1975) Borel determinacy. Ann Math 65:363\u2013371","journal-title":"Ann Math"},{"key":"242_CR29","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S Miyano","year":"1984","unstructured":"Miyano S, Hayashi T (1984) Alternating finite automata on \u03c9-words. Theor Comput Sci 32:321\u2013330","journal-title":"Theor Comput Sci"},{"key":"242_CR30","doi-asserted-by":"crossref","unstructured":"Piterman N (2006) From nondeterministic bu\u0307chi and Streett automata to deterministic parity automata. In: Proceedings of the 21st IEEE symposium on logic in computer science, pp 255\u2013264. IEEE press","DOI":"10.1109\/LICS.2006.28"},{"key":"242_CR31","doi-asserted-by":"crossref","unstructured":"Pnueli A, Rosner R (1989) On the synthesis of a reactive module. In: Proceedings of the 16th ACM symposium on principles of programming languages, pp 179\u2013190","DOI":"10.1145\/75277.75293"},{"key":"242_CR32","doi-asserted-by":"crossref","unstructured":"Pnueli A, Rosner R (1989) On the synthesis of an asynchronous reactive module. In: Proceedings of the 16th int. Colloq. on automata, languages, and programming, volume 372 of lecture notes in computer science, pp 652\u2013671. Springer","DOI":"10.1007\/BFb0035790"},{"key":"242_CR33","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J Reif","year":"1984","unstructured":"Reif J (1984) The complexity of two-player games of incomplete information. J Comput Syst Sci 29:274\u2013301","journal-title":"J Comput Syst Sci"},{"key":"242_CR34","doi-asserted-by":"crossref","unstructured":"Safra S (1992) Exponential determinization for \u03c9-automata with strong-fairness acceptance condition. In: Proceedings of the 24th ACM symposium on theory of computing","DOI":"10.1145\/129712.129739"},{"key":"242_CR35","doi-asserted-by":"crossref","unstructured":"Schewe S (2007) Solving parity games in big steps. In: Proceedings of the 27th conference on foundations of software technology and theoretical computer science, pp 449\u2013460","DOI":"10.1007\/978-3-540-77050-3_37"},{"key":"242_CR36","doi-asserted-by":"crossref","unstructured":"Topcu U, Ozay N, Liu J, Murray RM (2012) On synthesizing robust discrete controllers under modeling uncertainty. In: Hybrid systems: computation and control (part of CPS week 2012), HSCC\u201912, Beijing, China, April 17-19, 2012, pp 85\u201394","DOI":"10.1145\/2185632.2185648"},{"key":"242_CR37","doi-asserted-by":"crossref","unstructured":"Vardi M (2008) From verification to synthesis. In: Proceedings of the 2nd international conference on verified software: theories, tools, experiments, volume 5295 of lecture notes in computer science, page 2. Springer","DOI":"10.1007\/978-3-540-87873-5_2"},{"issue":"1","key":"242_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M Vardi","year":"1994","unstructured":"Vardi M, Wolper P (1994) Reasoning about infinite computations. Inf Comput 115(1):1\u201337","journal-title":"Inf Comput"},{"key":"242_CR39","doi-asserted-by":"crossref","unstructured":"Velner Y, Rabinovich A (2011) Church synthesis problem for noisy input. In: Proceedings of the 14th international conference on foundations of software science and computation structures, pp 275\u2013289","DOI":"10.1007\/978-3-642-19805-2_19"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-017-0242-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0242-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-017-0242-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:14:03Z","timestamp":1750194843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-017-0242-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,6]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["242"],"URL":"https:\/\/doi.org\/10.1007\/s10626-017-0242-0","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,6]]}}}