|
|||||||||||||||
Theoret. Informatics Appl. 36, 261-275 (2002)
DOI: 10.1051/ita:2002013
Permissive strategies: from parity games to safety games
Julien Bernet, David Janin and Igor WalukiewiczLaBRI - CNRS - Université de Bordeaux I, 351 cours de la Libération, 33405 Talence Cedex, France; bernet@labri.fr. janinligw@labri.fr.
(Received February, 2002. Accepted May, 2002.)
Abstract
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.
Mathematics Subject Classification. 68Q60, 68Q45, 91A50.
© EDP Sciences 2002
| What is OpenURL? |
- If your librarian has set up your subscription with an OpenURL resolver, OpenURL links appear automatically on the abstract pages.
- You can define your own OpenURL resolver with your EDPS Account. In this case your choice will be given priority over that of your library.
- You can use an add-on for your browser (Firefox or I.E.) to display OpenURL links on a page (see http://www.openly.com/openurlref/). You should disable this module if you wish to use the OpenURL server that you or your library have defined.


Document
BibSonomy
CiteUlike
Connotea
Del.icio.us
Digg
Facebook