ar X iv : 0 80 6 . 49 56 v 1 [ cs . L O ] 3 0 Ju n 20 08 GAME REFINEMENT RELATIONS AND METRICS

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal (e.g., " reach a target state "), the question of winning is thus a probabilistic one: " what is the maximal probability of winning from a given state? ". On these game structures, two fundamental notions are those of equivalences and met-rics. Given a set of winning conditions, two states are equivalent if the players can win the same games with the same probability from both states. Metrics provide a bound on the difference in the probabilities of winning across states, capturing a quantitative notion of state " similarity ". We introduce equivalences and metrics for two-player game structures, and we show that they characterize the difference in probability of winning games whose goals are expressed in the quantitative µ-calculus. The quantitative µ-calculus can express a large set of goals, including reachability, safety, and ω-regular properties. Thus, we claim that our relations and metrics provide the canonical extensions to games, of the classical notion of bisimulation for transition systems. We develop our results both for equivalences and metrics, which generalize bisimulation, and for asymmetrical versions, which generalize simulation. Abstract Devices and Modes of Computation] Relations between models .