{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:05Z","timestamp":1740099125850,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961415"},{"type":"electronic","value":"9783319961422"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96142-2_9","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T19:55:08Z","timestamp":1532116508000},"page":"99-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automata vs Linear-Programming Discounted-Sum Inclusion"],"prefix":"10.1007","author":[{"given":"Suguman","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swarat","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"9_CR1","unstructured":"RABIT: Ramsey-based B\u00fcchi automata inclusion testing"},{"key":"9_CR2","unstructured":"GLPK. https:\/\/www.gnu.org\/software\/glpk\/"},{"key":"9_CR3","unstructured":"GOAL. http:\/\/goal.im.ntu.edu.tw\/wiki\/"},{"key":"9_CR4","unstructured":"Rabit-Reduce. http:\/\/www.languageinclusion.org\/"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-14295-6_14","volume-title":"Computer Aided Verification","author":"PA Abdulla","year":"2010","unstructured":"Abdulla, P.A., et al.: Simulation subsumption in Ramsey-based B\u00fcchi automata universality and inclusion testing. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 132\u2013147. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_14"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-23217-6_13","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"PA Abdulla","year":"2011","unstructured":"Abdulla, P.A., et al.: Advanced Ramsey-based B\u00fcchi automata inclusion testing. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 187\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_13"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Andersen, G., Conitzer, V.: Fast equilibrium computation for infinitely repeated games. In: Proceedings of AAAI, pp. 53\u201359 (2013)","DOI":"10.1609\/aaai.v27i1.8573"},{"key":"9_CR8","unstructured":"Andersson, D.: An improved algorithm for discounted payoff games. In: ESSLLI Student Session, pp. 91\u201398 (2006)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-319-89366-2_23","volume-title":"Foundations of Software Science and Computation Structures","author":"S Bansal","year":"2018","unstructured":"Bansal, S., Chaudhuri, S., Vardi, M.Y.: Comparator automata in quantitative verification. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 420\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_23"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Boker, U., Henzinger, T. A.: Exact and approximate determinization of discounted-sum automata. LMCS, 10(1) (2014)","DOI":"10.2168\/LMCS-10(1:10)2014"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Boker, U., Henzinger, T.A., Otop, J.: The target discounted-sum problem. In Proceedings of LICS, pp. 750\u2013761 (2015)","DOI":"10.1109\/LICS.2015.74"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-22110-1_20","volume-title":"Computer Aided Verification","author":"P \u010cern\u00fd","year":"2011","unstructured":"\u010cern\u00fd, P., Chatterjee, K., Henzinger, T.A., Radhakrishna, A., Singh, R.: Quantitative synthesis for concurrent programs. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 243\u2013259. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_20"},{"issue":"1","key":"9_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/2480359.2429085","volume":"48","author":"P Cerny","year":"2013","unstructured":"Cerny, P., Henzinger, T.A., Radhakrishna, A.: Quantitative abstraction refinement. ACM SIGPLAN Not. 48(1), 115\u2013128 (2013)","journal-title":"ACM SIGPLAN Not."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Expressiveness and closure properties for quantitative languages. In: Proceedings of LICS, pp. 199\u2013208. IEEE (2009)","DOI":"10.1109\/LICS.2009.16"},{"issue":"4","key":"9_CR15","first-page":"23","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. Trans. Comput. Log. 11(4), 23 (2010)","journal-title":"Trans. Comput. Log."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11672142_26","volume-title":"STACS 2006","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Markov decision processes with multiple objectives. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 325\u2013336. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_26"},{"key":"9_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"issue":"3","key":"9_CR18","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. Trans. Comput. Log. 2(3), 408\u2013429 (2001)","journal-title":"Trans. Comput. Log."},{"issue":"1","key":"9_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/2480359.2429079","volume":"48","author":"R Mayr","year":"2013","unstructured":"Mayr, R., Clemente, L.: Advanced automata minimization. ACM SIGPLAN Not. 48(1), 63\u201374 (2013)","journal-title":"ACM SIGPLAN Not."},{"issue":"1","key":"9_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0022-0531(86)90021-9","volume":"39","author":"A Rubinstein","year":"1986","unstructured":"Rubinstein, A.: Finite automata play the repeated prisoner\u2019s dilemma. J. Econ. Theory 39(1), 83\u201396 (1986)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"9_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11591191_28","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Tabakov","year":"2005","unstructured":"Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396\u2013411. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_28"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36387-4_2","volume-title":"Automata Logics, and Infinite Games","author":"R Mazala","year":"2002","unstructured":"Mazala, R.: Infinite games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 23\u201338. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_2"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96142-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T00:26:35Z","timestamp":1661646395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96142-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961415","9783319961422"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96142-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}