{"publisher":"Elsevier","year":"2012","ec_funded":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"day":"02","date_published":"2012-11-02T00:00:00Z","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","quality_controlled":"1","scopus_import":1,"title":"Energy parity games","oa_version":"Published Version","publist_id":"3736","file":[{"relation":"main_file","file_name":"2012_Elsevier_Chatterjee.pdf","access_level":"open_access","checksum":"719e4a5af5a01ad3f2f7f7f05b3c2b09","date_created":"2019-02-06T11:56:22Z","date_updated":"2020-07-14T12:45:57Z","creator":"kschuh","file_id":"5935","content_type":"application/pdf","file_size":351271}],"pubrep_id":"935","intvolume":"       458","language":[{"iso":"eng"}],"status":"public","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"page":"49 - 60","external_id":{"arxiv":["1001.5183"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["004"],"oa":1,"file_date_updated":"2020-07-14T12:45:57Z","department":[{"_id":"KrCh"}],"citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2012). Energy parity games. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>","ista":"Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">https://doi.org/10.1016/j.tcs.2012.07.038</a>.","ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” <i>Theoretical Computer Science</i>, vol. 458. Elsevier, pp. 49–60, 2012.","ama":"Chatterjee K, Doyen L. Energy parity games. <i>Theoretical Computer Science</i>. 2012;458:49-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">10.1016/j.tcs.2012.07.038</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” <i>Theoretical Computer Science</i>, vol. 458, Elsevier, 2012, pp. 49–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.07.038\">10.1016/j.tcs.2012.07.038</a>.","short":"K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60."},"month":"11","date_created":"2018-12-11T12:00:37Z","_id":"2972","doi":"10.1016/j.tcs.2012.07.038","author":[{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","first_name":"Laurent","last_name":"Doyen"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3851"}]},"publication":"Theoretical Computer Science","publication_status":"published","abstract":[{"lang":"eng","text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games."}],"date_updated":"2023-02-23T11:45:29Z","volume":458,"type":"journal_article","has_accepted_license":"1"}