Permissive strategies: from parity games to safety games - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Année : 2002

Permissive strategies: from parity games to safety games

Résumé

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strate- gies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding the set of winning positions in a parity game. The algorithm can be seen as a reduction of a parity to a safety game and computation of the set of winning positions in the resulting game.
Fichier principal
Vignette du fichier
m4.pdf (156.51 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00659985 , version 1 (14-01-2012)

Identifiants

  • HAL Id : hal-00659985 , version 1

Citer

Julien Bernet, David Janin, Igor Walukiewicz. Permissive strategies: from parity games to safety games. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2002, 36, pp.261-275. ⟨hal-00659985⟩

Collections

CNRS
173 Consultations
156 Téléchargements

Partager

Gmail Facebook X LinkedIn More