{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:53Z","timestamp":1760202713310},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319341705"},{"type":"electronic","value":"9783319341712"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-34171-2_1","type":"book-chapter","created":{"date-parts":[[2016,5,30]],"date-time":"2016-05-30T02:34:18Z","timestamp":1464575658000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["On High-Quality Synthesis"],"prefix":"10.1007","author":[{"given":"Orna","family":"Kupferman","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 7966, pp. 15\u201327. Springer, Heidelberg (2013)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/978-3-642-54862-8_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Almagor","year":"2014","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Discounting in LTL. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 424\u2013439. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Almagor, S., Boker, U., Kupferman, O.: Formalizing and reasoning about quality. J. ACM (2016, to appear)","key":"1_CR3","DOI":"10.1145\/2875421"},{"unstructured":"Almagor, S., Kuperberg, D., Kupferman, O.: Regular sensing. In: Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 29, pp. 161\u2013173. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2014)","key":"1_CR4"},{"unstructured":"Almagor, S., Kuperberg, D., Kupferman, O.: The sensing cost of monitoring and synthesis. In: Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 35, pp. 380\u2013393. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2015)","key":"1_CR5"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-662-44584-6_12","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"G Avni","year":"2014","unstructured":"Avni, G., Kupferman, O.: Synthesis from component libraries with costs. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 156\u2013172. Springer, Heidelberg (2014)"},{"issue":"3\u20134","key":"1_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00236-013-0191-5","volume":"51","author":"R Bloem","year":"2014","unstructured":"Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T.A., Hofferek, G., Jobstmann, B., K\u00f6nighofer, B., K\u00f6nighofer, R.: Synthesizing robust systems. Acta Inf. 51(3\u20134), 193\u2013220 (2014)","journal-title":"Acta Inf."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5643, pp. 140\u2013156. Springer, Heidelberg (2009)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-85361-9_14","volume-title":"CONCUR 2008 - Concurrency Theory","author":"K Chatterjee","year":"2008","unstructured":"Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Environment assumptions for synthesis. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 147\u2013161. Springer, Heidelberg (2008)"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/978-3-642-14295-6_34","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Jobstmann, B., Singh, R.: Measuring and synthesizing systems in probabilistic environments. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 380\u2013395. Springer, Heidelberg (2010)"},{"unstructured":"Church, A.: Logic, arithmetics, and automata. In: Proceedings of the International Congress of Mathematicians, 1962, pp. 23\u201335. Institut Mittag-Leffler (1963)","key":"1_CR11"},{"issue":"1","key":"1_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.tcs.2005.07.033","volume":"345","author":"L Alfaro de","year":"2005","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. Theor. Comput. Sci. 345(1), 139\u2013170 (2005)","journal-title":"Theor. Comput. Sci."},{"volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009)","key":"1_CR13"},{"issue":"37","key":"1_CR14","doi-asserted-by":"crossref","first-page":"3481","DOI":"10.1016\/j.tcs.2009.03.029","volume":"410","author":"M Droste","year":"2009","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. Theor. Comput. Sci. 410(37), 3481\u20133494 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2011.11.008","volume":"418","author":"M Droste","year":"2012","unstructured":"Droste, M., Vogler, H.: Weighted automata and multi-valued logics over arbitrary bounded lattices. Theor. Comput. Sci. 418, 14\u201336 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1_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.: Model checking quantitative linear time logic. Electr. Notes Theor. Comput. Sci. 220(3), 61\u201377 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 190\u2013204. Springer, Heidelberg (2010)"},{"unstructured":"Grinstead, C., Snell, J.L.: 11:Markov chains. In: Introduction to Probability. American Mathematical Society (1997)","key":"1_CR18"},{"key":"1_CR19","volume-title":"Metrics and Models in Software Quality Engineering","author":"SH Kans","year":"2002","unstructured":"Kans, S.H.: Metrics and Models in Software Quality Engineering. Addison-Wesley Longman Publishing Co., Boston (2002)"},{"issue":"3","key":"1_CR20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1142\/S0218196794000063","volume":"4","author":"D Krob","year":"1994","unstructured":"Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. Algebra Comput. 4(3), 405\u2013425 (1994)","journal-title":"Int. J. Algebra Comput."},{"unstructured":"Kupferman, O., Lustig, Y., Vardi, M.Y., Yannakakis, M.: Temporal synthesis for bounded systems and environments. In: Proceedings of the 28th Symposium on Theoretical Aspects of Computer Science, pp. 615\u2013626 (2011)","key":"1_CR21"},{"issue":"3","key":"1_CR22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1011254632723","volume":"19","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Model checking of safety properties. Formal Methods Syst. Des. 19(3), 291\u2013314 (2001)","journal-title":"Formal Methods Syst. Des."},{"doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z.: Quantitative verification: models techniques and tools. In: ESEC\/SIGSOFT FSE, pp. 449\u2013458 (2007)","key":"1_CR23","DOI":"10.1145\/1287624.1287688"},{"issue":"2","key":"1_CR24","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"issue":"2","key":"1_CR25","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1109\/TSMCB.2003.819485","volume":"34","author":"S Moon","year":"2004","unstructured":"Moon, S., Lee, K., Lee, D.: Fuzzy branching temporal logic. IEEE Trans. Syst. Man Cybern. Part B 34(2), 1045\u20131055 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th ACM Symposium on Principles of Programming Languages, pp. 179\u2013190 (1989)","key":"1_CR26","DOI":"10.1145\/75277.75293"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/978-3-540-75596-8_33","volume-title":"Automated Technology for Verification and Analysis","author":"S Schewe","year":"2007","unstructured":"Schewe, S., Finkbeiner, B.: Bounded synthesis. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 474\u2013488. Springer, Heidelberg (2007)"},{"key":"1_CR28","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/BF01211865","volume":"6","author":"AP Sistla","year":"1994","unstructured":"Sistla, A.P.: Safety, liveness and fairness in temporal logic. Formal Aspects Comput. 6, 495\u2013511 (1994)","journal-title":"Formal Aspects Comput."},{"key":"1_CR29","volume-title":"Code Quality: The Open Source Perspective","author":"D Spinellis","year":"2006","unstructured":"Spinellis, D.: Code Quality: The Open Source Perspective. Addison-Wesley Professional, Upper Saddle River (2006)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-87873-5_2","volume-title":"Verified Software: Theories, Tools, Experiments","author":"MY Vardi","year":"2008","unstructured":"Vardi, M.Y.: From verification to synthesis. In: Shankar, N., Woodcock, J. (eds.) VSTTE 2008. LNCS, vol. 5295, p. 2. Springer, Heidelberg (2008)"},{"unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the 1st IEEE Symposium on Logic in Computer Science, pp. 332\u2013344 (1986)","key":"1_CR31"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-34171-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T21:13:37Z","timestamp":1567977217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-34171-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319341705","9783319341712"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-34171-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}