{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:26:57Z","timestamp":1726759617670},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":257,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 23499-N23","S11407-N23"],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1016\/j.tcs.2012.07.038","type":"journal-article","created":{"date-parts":[[2012,8,9]],"date-time":"2012-08-09T20:47:07Z","timestamp":1344545227000},"page":"49-60","source":"Crossref","is-referenced-by-count":64,"special_numbering":"C","title":["Energy parity games"],"prefix":"10.1016","volume":"458","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Doyen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2012.07.038_br000005","series-title":"Proc. of ICALP","first-page":"1","article-title":"Realizable and unrealizable specifications of reactive systems","volume":"vol. 372","author":"Abadi","year":"1989"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2012.07.038_br000010","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0304-3975(03)00427-4","article-title":"Memoryless determinacy of parity and mean payoff games: a simple proof","volume":"310","author":"Bj\u00f6rklund","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2012.07.038_br000015","series-title":"Proc. of CAV","first-page":"140","article-title":"Better quality in synthesis through quantitative objectives","volume":"vol. 5643","author":"Bloem","year":"2009"},{"key":"10.1016\/j.tcs.2012.07.038_br000020","series-title":"Proc. of FORMATS","first-page":"33","article-title":"Infinite runs in weighted timed automata with energy constraints","volume":"vol. 5215","author":"Bouyer","year":"2008"},{"key":"10.1016\/j.tcs.2012.07.038_br000025","series-title":"Proc. of ATVA: Automated Technology for Verification and Analysis","first-page":"135","article-title":"Measuring permissiveness in parity games: Mean-payoff parity games revisited","volume":"vol. 6996","author":"Bouyer","year":"2011"},{"issue":"2","key":"10.1016\/j.tcs.2012.07.038_br000030","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","article-title":"Faster algorithms for mean-payoff games","volume":"38","author":"Brim","year":"2011","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"10.1016\/j.tcs.2012.07.038_br000035","first-page":"206","article-title":"Solving sequential conditions by finite-state strategies","volume":"25","author":"B\u00fcchi","year":"1987","journal-title":"SIAM Journal on Control and Optimization"},{"key":"10.1016\/j.tcs.2012.07.038_br000040","series-title":"Proc. of EMSOFT","first-page":"117","article-title":"Resource interfaces","volume":"vol. 2855","author":"Chakrabarti","year":"2003"},{"key":"10.1016\/j.tcs.2012.07.038_br000045","series-title":"Proc. of MEMICS","first-page":"45","article-title":"Faster algorithm for mean-payoff games","author":"Chaloupka","year":"2009"},{"key":"10.1016\/j.tcs.2012.07.038_br000050","series-title":"Proc. of LICS","first-page":"178","article-title":"Mean-payoff parity games","author":"Chatterjee","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2012.07.038_br000055","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The complexity of stochastic games","volume":"96","author":"Condon","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2012.07.038_br000060","series-title":"Proc. of FOCS","first-page":"368","article-title":"Tree automata, mu-calculus and determinacy","author":"Emerson","year":"1991"},{"key":"10.1016\/j.tcs.2012.07.038_br000065","series-title":"Proc. of CAV","first-page":"385","article-title":"On model-checking for fragments of \u03bc-calculus","volume":"vol. 697","author":"Emerson","year":"1993"},{"key":"10.1016\/j.tcs.2012.07.038_br000070","series-title":"Proc. of CONCUR: Concurrency Theory","first-page":"428","article-title":"Games where you can play optimally without any memory","volume":"vol. 3653","author":"Gimbert","year":"2005"},{"key":"10.1016\/j.tcs.2012.07.038_br000075","series-title":"Automata, Logics, and Infinite Games: A Guide to Current Research","volume":"vol. 2500","year":"2002"},{"key":"10.1016\/j.tcs.2012.07.038_br000080","series-title":"Proc. of STOC","first-page":"60","article-title":"Trees, automata, and games","author":"Gurevich","year":"1982"},{"key":"10.1016\/j.tcs.2012.07.038_br000085","series-title":"Proc. of ICALP: Automata, Languages and Programming (2)","first-page":"336","article-title":"Half-positional determinacy of infinite games","volume":"vol. 4052","author":"Kopczy\u0144ski","year":"2006"},{"issue":"2","key":"10.1016\/j.tcs.2012.07.038_br000090","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","article-title":"Infinite games played on finite graphs","volume":"65","author":"McNaughton","year":"1993","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.tcs.2012.07.038_br000095","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, On the synthesis of a reactive module, in: Proc. of POPL, 1989, pp. 179\u2013190.","DOI":"10.1145\/75277.75293"},{"issue":"1","key":"10.1016\/j.tcs.2012.07.038_br000100","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","article-title":"Supervisory control of a class of discrete event processes","volume":"25","author":"Ramadge","year":"1987","journal-title":"SIAM Journal on Control and Optimization"},{"key":"10.1016\/j.tcs.2012.07.038_br000105","series-title":"Proc. of FoSSaCS","first-page":"337","article-title":"Parity games played on transition graphs of one-counter processes","volume":"vol. 3921","author":"Serre","year":"2006"},{"key":"10.1016\/j.tcs.2012.07.038_br000110","doi-asserted-by":"crossref","unstructured":"L.S. Shapley, Stochastic games, in: Proc. of the National Academy of Science USA, vol. 39, 1953, pp. 1095\u20131100.","DOI":"10.1073\/pnas.39.10.1095"},{"key":"10.1016\/j.tcs.2012.07.038_br000115","series-title":"Handbook of Formal Languages","first-page":"389","article-title":"Languages, automata, and logic","volume":"vol. 3","author":"Thomas","year":"1997"},{"key":"10.1016\/j.tcs.2012.07.038_br000120","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","article-title":"Infinite games on finitely coloured graphs with applications to automata on infinite trees","volume":"200","author":"Zielonka","year":"1998","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"10.1016\/j.tcs.2012.07.038_br000125","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theoretical Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512007475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397512007475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:02:54Z","timestamp":1616756574000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397512007475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":25,"alternative-id":["S0304397512007475"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2012.07.038","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}