{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:42:53Z","timestamp":1725698573671},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_17","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"160-171","source":"Crossref","is-referenced-by-count":0,"title":["Solving Counter Parity Games"],"prefix":"10.1007","author":[{"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Le\u00dfenich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-24372-1_16","volume-title":"Automated Technology for Verification and Analysis","author":"B. Aminof","year":"2011","unstructured":"Aminof, B., Kupferman, O., Lampert, R.: Formal Analysis of Online Algorithms. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 213\u2013227. Springer, Heidelberg (2011)"},{"key":"17_CR2","unstructured":"Berwanger, D., Kaiser, \u0141., Le\u00dfenich, S.: Imperfect recall and counter games. Research Report LSV-11-20, LSV, ENS Cachan, France (2011), \n                  \n                    http:\/\/www.lsv.ens-cachan.fr\/Publis\/RAPPORTS_LSV\/PDF\/rr-lsv-2011-20.pdf"},{"key":"17_CR3","unstructured":"Br\u00e1zdil, T., Forejt, V., Krc\u00e1l, J., Kret\u00ednsk\u00fd, J., Kucera, A.: Continuous-time stochastic games with time-bounded reachability. In: Proc. of FSTTCS 2009, pp. 61\u201372 (2009)"},{"key":"17_CR4","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: Proc. of FSTTCS 2010, pp. 505\u2013516 (2010)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-21254-3_17","volume-title":"Language and Automata Theory and Applications","author":"K. Chatterjee","year":"2011","unstructured":"Chatterjee, K., Henzinger, T.A., Horn, F.: The Complexity of Request-Response Games. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 227\u2013237. Springer, Heidelberg (2011)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0345(1), 139\u2013170 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/s00224-009-9201-y","volume":"47","author":"D. Fischer","year":"2010","unstructured":"Fischer, D., Gr\u00e4del, E., Kaiser, \u0141.: Model checking games for the quantitative \u03bc-calculus. Theory Comput. Syst.\u00a047(3), 696\u2013719 (2010)","journal-title":"Theory Comput. Syst."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-22012-8_32","volume-title":"Automata, Languages and Programming","author":"D. Fischer","year":"2011","unstructured":"Fischer, D., Kaiser, \u0141.: Model Checking the Quantitative \u03bc-Calculus on Linear Hybrid Systems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 404\u2013415. Springer, Heidelberg (2011)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-88387-6_31","volume-title":"Automated Technology for Verification and Analysis","author":"F. Horn","year":"2008","unstructured":"Horn, F., Thomas, W., Wallmeier, N.: Optimal Strategy Synthesis in Request-Response Games. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol.\u00a05311, pp. 361\u2013373. Springer, Heidelberg (2008)"},{"key":"17_CR10","series-title":"LIPIcs","volume-title":"Proc. of CSL 2012","author":"\u0141. Kaiser","year":"2012","unstructured":"Kaiser, \u0141., Le\u00dfenich, S.: Counting \u03bc-calculus on structured transition systems. In: Proc. of CSL 2012. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany (to appear, 2012)"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10703-009-0067-z","volume":"34","author":"O. Kupferman","year":"2009","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. Formal Methods in System Design\u00a034(2), 83\u2013103 (2009)","journal-title":"Formal Methods in System Design"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite Games and Verification (Extended Abstract of a Tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/(SICI)1097-0118(199711)26:3<119::AID-JGT1>3.0.CO;2-U","volume":"26","author":"H. Wan","year":"1997","unstructured":"Wan, H.: Upper bounds for Ramsey numbers R(3, 3,\u2026, 3) and Schur numbers. Journal of Graph Theory\u00a026(3), 119\u2013122 (1997)","journal-title":"Journal of Graph Theory"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Zimmermann, M.: Optimal bounds in parametric LTL games. In: Proc. of GandALF 2011, pp. 146\u2013161 (2011)","DOI":"10.4204\/EPTCS.54.11"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:07:59Z","timestamp":1620130079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}