Dicing on the Streett

Florian Horn (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

Streett/Rabin games are an adequate model of strong fairness in reactive systems. We show here some results about their stochastic version. We extend the known lower bound in memory for the pure winning strategies of the Streett player to randomized strategies. We also propose algorithms computing the almost sure winning regions of both players in stochastic Streett/Rabin games. The Rabin algorithm also yields directly a pure memoryless almost-sure winning strategy.

Mots clés: Graph algorithms; Games; Memory; Randomness

Domaines: Informatique

Florian Horn. Dicing on the Streett. Information Processing Letters, 2007, 104 (1), pp.1-9. ⟨10.1016/j.ipl.2007.04.010⟩. ⟨hal-00164149⟩