{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:09Z","timestamp":1725869469964},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490519"},{"type":"electronic","value":"9783319490526"}],"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-49052-6_8","type":"book-chapter","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T14:34:50Z","timestamp":1477924490000},"page":"117-133","source":"Crossref","is-referenced-by-count":8,"title":["Improving Priority Promotion for Parity Games"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Benerecetti","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Dell\u2019Erba","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Mogavero","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511973468","volume-title":"Lectures in Game Theory for Computer Scientists","author":"K Apt","year":"2011","unstructured":"Apt, K., Gr\u00e4del, E.: Lectures in Game Theory for Computer Scientists. Cambridge University Press, Cambridge (2011)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-41540-6_15","volume-title":"Computer Aided Verification","author":"M Benerecetti","year":"2016","unstructured":"Benerecetti, M., Dell\u2019Erba, D., Mogavero, F.: Solving parity games via priority promotion. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 270\u2013290. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-41540-6_15"},{"key":"8_CR3","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T., Raskin, J.-F.: Generalized mean-payoff and energy games. In: FSTTCS 2010. LIPIcs, vol. 8, pp. 505\u2013516. Leibniz-Zentrum fuer Informatik (2010)"},{"issue":"2","key":"8_CR4","first-page":"203","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. IC 96(2), 203\u2013224 (1992)","journal-title":"IC"},{"issue":"2","key":"8_CR5","first-page":"109","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. IJGT 8(2), 109\u2013113 (1979)","journal-title":"IJGT"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs (extended abstract). In: FOCS 1988, pp. 328\u2013337. IEEE Computer Society (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"8_CR7","unstructured":"Emerson, E., Jutla, C.: Tree automata, muCalculus, and determinacy. In: FOCS 1991, pp. 368\u2013377. IEEE Computer Society (1991)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E Emerson","year":"1993","unstructured":"Emerson, E., Jutla, C., Sistla, A.: On model-checking for fragments of $$\\mu $$ -calculus. In: Courcoubetis, C. (ed.) CAV \u201993. LNCS, vol. 697, pp. 385\u2013396. Springer, Heidelberg (1993). doi: 10.1007\/3-540-56922-7_32"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-04761-9_15","volume-title":"Automated Technology for Verification and Analysis","author":"O Friedmann","year":"2009","unstructured":"Friedmann, O., Lange, M.: Solving parity games in practice. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 182\u2013196. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04761-9_15"},{"key":"8_CR10","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games: A Guide to Current Research","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)"},{"issue":"5","key":"8_CR11","first-page":"85","volume":"28","author":"V Gurevich","year":"1990","unstructured":"Gurevich, V., Karzanov, A., Khachivan, L.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSRCMMP 28(5), 85\u201391 (1990)","journal-title":"USSRCMMP"},{"issue":"3","key":"8_CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzi\u0144ski","year":"1998","unstructured":"Jurdzi\u0144ski, M.: Deciding the winner in parity games is in UP $$\\cap $$ co-Up. IPL 68(3), 119\u2013124 (1998)","journal-title":"IPL"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000). doi: 10.1007\/3-540-46541-3_24"},{"issue":"4","key":"8_CR14","first-page":"1519","volume":"38","author":"M Jurdzi\u0144ski","year":"2008","unstructured":"Jurdzi\u0144ski, M., Paterson, M., Zwick, U.: A deterministic subexponential algorithm for solving parity games. SJM 38(4), 1519\u20131532 (2008)","journal-title":"SJM"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.: Weak alternating automata and tree automata emptiness. In: STOC 1998, pp. 224\u2013233. Association for Computing Machinery (1998)","DOI":"10.1145\/276698.276748"},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An automata theoretic approach to branching-time model checking. JACM 47(2), 312\u2013360 (2000)","journal-title":"JACM"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-16066-3_15","volume-title":"Computation Theory","author":"AW Mostowski","year":"1985","unstructured":"Mostowski, A.W.: Regular expressions for infinite trees and a standard form of automata. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 157\u2013168. Springer, Heidelberg (1985). doi: 10.1007\/3-540-16066-3_15"},{"key":"8_CR18","unstructured":"Mostowski, A.: Games with forbidden positions. University of Gda\u0144sk, Gda\u0144sk, Poland, Technical report (1991)"},{"key":"8_CR19","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. 4855, pp. 449\u2013460. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-77050-3_37"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-540-87531-4_27","volume-title":"Computer Science Logic","author":"S Schewe","year":"2008","unstructured":"Schewe, S.: An optimal strategy improvement algorithm for solving parity and payoff games. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 369\u2013384. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-87531-4_27"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-47666-6_31","volume-title":"Automata, Languages, and Programming","author":"S Schewe","year":"2015","unstructured":"Schewe, S., Trivedi, A., Varghese, T.: Symmetric strategy improvement. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 388\u2013400. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47666-6_31"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification","author":"J V\u00f6ge","year":"2000","unstructured":"V\u00f6ge, J., Jurdzi\u0144ski, M.: A discrete strategy improvement algorithm for solving parity games. In: Allen Emerson, E., Sistla, A.P. (eds.) CAV 2000. Lecture Notes in Computer Science, vol. 1855, pp. 202\u2013215. Springer, Heidelberg (2000). doi: 10.1007\/10722167_18"},{"issue":"1\u20132","key":"8_CR23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS 200(1\u20132), 135\u2013183 (1998)","journal-title":"TCS"},{"issue":"1\u20132","key":"8_CR24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. TCS 158(1\u20132), 343\u2013359 (1996)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Hardware and Software: Verification and Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49052-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T05:06:55Z","timestamp":1568524015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49052-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490519","9783319490526"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49052-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}
