{"date_published":"2011-06-04T00:00:00Z","project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","month":"06","citation":{"apa":"Chatterjee, K., &#38; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>","chicago":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. <a href=\"https://doi.org/10.4204/EPTCS.54.6\">https://doi.org/10.4204/EPTCS.54.6</a>.","ieee":"K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.","ama":"Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>","mla":"Chatterjee, Krishnendu, and Nathanaël Fijalkow. <i>A Reduction from Parity Games to Simple Stochastic Games</i>. Vol. 54, EPTCS, 2011, pp. 74–86, doi:<a href=\"https://doi.org/10.4204/EPTCS.54.6\">10.4204/EPTCS.54.6</a>.","ista":"Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.","short":"K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86."},"alternative_title":["EPTCS"],"doi":"10.4204/EPTCS.54.6","publist_id":"3272","scopus_import":1,"oa_version":"Submitted Version","year":"2011","volume":54,"oa":1,"title":"A reduction from parity games to simple stochastic games","language":[{"iso":"eng"}],"conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2011-06-15","location":"Minori, Italy","end_date":"2011-06-17"},"date_created":"2018-12-11T12:02:49Z","date_updated":"2021-01-12T07:42:51Z","intvolume":"        54","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"},{"last_name":"Fijalkow","full_name":"Fijalkow, Nathanaël","first_name":"Nathanaël"}],"publisher":"EPTCS","type":"conference","department":[{"_id":"KrCh"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"74 - 86","main_file_link":[{"url":"http://arxiv.org/abs/1106.1232","open_access":"1"}],"day":"04","_id":"3349","abstract":[{"text":"Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model various open systems in computer science, as for instance turn-based or concurrent moves, and deterministic or stochastic transitions. In this paper, we are interested in turn-based games, and specifically in deterministic parity games and stochastic reachability games (also known as simple stochastic games). We present a simple, direct and efficient reduction from deterministic parity games to simple stochastic games: it yields an arena whose size is linear up to a logarithmic factor in size of the original arena.","lang":"eng"}],"status":"public"}