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 strategies. 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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
Permissive_strategies_from_parity_games.pdf (197.09 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00306411 , version 1 (25-07-2008)

Identifiants

  • HAL Id : hal-00306411 , 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.251--275. ⟨hal-00306411⟩

Collections

CNRS
102 Consultations
187 Téléchargements

Partager

Gmail Facebook X LinkedIn More