{"language":[{"iso":"eng"}],"day":"08","file":[{"file_id":"5516","checksum":"ede787a10e74e4f7db302fab8f12f3ca","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"IST-2013-128-v1+1_full_stoch_mpp.pdf","date_created":"2018-12-12T11:53:54Z","file_size":387467,"date_updated":"2020-07-14T12:46:45Z","creator":"system"}],"year":"2013","publication_status":"published","publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","date_created":"2018-12-12T11:39:09Z","related_material":{"record":[{"status":"public","id":"2212","relation":"later_version"}]},"doi":"10.15479/AT:IST-2013-128-v1-1","date_published":"2013-07-08T00:00:00Z","page":"22","oa_version":"Published Version","abstract":[{"text":"The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2-1/2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other transitions are determined probabilistically. We consider 2-1/2-player games where the objective of the System is the conjunction of a qualitative objective (specified as a parity condition) and a quantitative objective (specified as a mean-payoff condition). We establish that the problem of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP ∩ coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic) with only parity objectives, or with only mean-payoff objectives. We present an algorithm running\r\nin time O(d · n^{2d}·MeanGame) to compute the set of almost-sure winning states from which the objective\r\ncan be ensured with probability 1, where n is the number of states of the game, d the number of priorities\r\nof the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states\r\nin 2-1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems\r\nwith both functional requirement (given as a qualitative objective) and performance requirement (given\r\nas a quantitative objective).","lang":"eng"}],"month":"07","oa":1,"publisher":"IST Austria","alternative_title":["IST Austria Technical Report"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000","005","510"],"date_updated":"2023-02-23T10:33:08Z","citation":{"ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria; 2013. doi:10.15479/AT:IST-2013-128-v1-1","apa":"Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria. https://doi.org/10.15479/AT:IST-2013-128-v1-1","mla":"Chatterjee, Krishnendu, et al. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013, doi:10.15479/AT:IST-2013-128-v1-1.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-128-v1-1."},"file_date_updated":"2020-07-14T12:46:45Z","title":"Perfect-information stochastic mean-payoff parity games","department":[{"_id":"KrCh"}],"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"first_name":"Hugo","last_name":"Gimbert","full_name":"Gimbert, Hugo"},{"first_name":"Youssouf","last_name":"Oualhadj","full_name":"Oualhadj, Youssouf"}],"_id":"5405","pubrep_id":"128","status":"public","type":"technical_report"}