Reduction of stochastic parity to stochastic mean-payoff games

Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as parity objectives, and mean-payoff (or limit-average) objectives. These games lie in NP coNP. We present a polynomial-time Turing reduction of stochastic parity games to stochastic mean-payoff games. Keywords. Formal verification and model checking, Stochastic games, Parity objectives, Meanpayoff objectives.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Krishnendu Chatterjee, Thomas A. Henzinger
• Keywords: IPL 2008, Parity Objectives, Stochastic Graph Games, Stochastic Parity Games