Geodesic
Permissive strategies : from parity games to safety games
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 3, pp. 261-275

Voir la notice de l'article provenant de la source Numdam

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.

DOI : 10.1051/ita:2002013
Classification : 68Q60, 68Q45, 91A50 
@article{ITA_2002__36_3_261_0,
     author = {Bernet, Julien and Janin, David and Walukiewicz, Igor},
     title = {Permissive strategies : from parity games to safety games},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {261--275},
     publisher = {EDP-Sciences},
     volume = {36},
     number = {3},
     year = {2002},
     doi = {10.1051/ita:2002013},
     mrnumber = {1958243},
     zbl = {1090.91514},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ita:2002013/}
}
TY  - JOUR
AU  - Bernet, Julien
AU  - Janin, David
AU  - Walukiewicz, Igor
TI  - Permissive strategies : from parity games to safety games
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2002
SP  - 261
EP  - 275
VL  - 36
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ita:2002013/
DO  - 10.1051/ita:2002013
LA  - en
ID  - ITA_2002__36_3_261_0
ER  - 
%0 Journal Article
%A Bernet, Julien
%A Janin, David
%A Walukiewicz, Igor
%T Permissive strategies : from parity games to safety games
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2002
%P 261-275
%V 36
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ita:2002013/
%R 10.1051/ita:2002013
%G en
%F ITA_2002__36_3_261_0
Bernet, Julien; Janin, David; Walukiewicz, Igor. Permissive strategies : from parity games to safety games. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 36 (2002) no. 3, pp. 261-275. doi: 10.1051/ita:2002013

Cité par Sources :