{"ec_funded":1,"doi":"10.1007/978-3-642-54830-7_14","conference":{"end_date":"2014-04-13","start_date":"2014-04-05","name":"FoSSaCS: Foundations of Software Science and Computation Structures","location":"Grenoble, France"},"intvolume":"      8412","publist_id":"4758","year":"2014","language":[{"iso":"eng"}],"day":"01","date_updated":"2023-02-23T12:24:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","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). We present an algorithm running in time O(d·n2d·MeanGame) to compute the set of almost-sure winning states from which the objective can be ensured with probability 1, where n is the number of states of the game, d the number of priorities of the parity objective, and MeanGame is the complexity to compute the set of almost-sure winning states in 2 1/2-player mean-payoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). ","lang":"eng"}],"page":"210 - 225","oa_version":"None","alternative_title":["LNCS"],"type":"conference","department":[{"_id":"KrCh"}],"volume":8412,"quality_controlled":"1","publication_status":"published","_id":"2212","status":"public","citation":{"apa":"Chatterjee, K., Doyen, L., Gimbert, H., &#38; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>","mla":"Chatterjee, Krishnendu, et al. <i>Perfect-Information Stochastic Mean-Payoff Parity Games</i>. Vol. 8412, Springer, 2014, pp. 210–25, doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>.","ista":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.","ieee":"K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.","ama":"Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. Perfect-information stochastic mean-payoff parity games. In: Vol 8412. Springer; 2014:210-225. doi:<a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">10.1007/978-3-642-54830-7_14</a>","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,” 8412:210–25. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54830-7_14\">https://doi.org/10.1007/978-3-642-54830-7_14</a>.","short":"K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225."},"author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Gimbert, Hugo","first_name":"Hugo","last_name":"Gimbert"},{"first_name":"Youssouf","last_name":"Oualhadj","full_name":"Oualhadj, Youssouf"}],"month":"04","related_material":{"record":[{"id":"5405","status":"public","relation":"earlier_version"}]},"scopus_import":1,"date_created":"2018-12-11T11:56:21Z","acknowledgement":"This research was supported by European project Cassting (FP7-601148).\r\nA Technical Report of this paper is available at: \r\nhttps://repository.ist.ac.at/id/eprint/128.","date_published":"2014-04-01T00:00:00Z","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"title":"Perfect-information stochastic mean-payoff parity games"}