The surprizing complexity of generalized reachability games - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

The surprizing complexity of generalized reachability games

Résumé

Games on graphs with omega-regular objectives provide a natural model for reactive systems. In this paper, we consider generalized reachability games: given k subsets of vertices, the objective is to reach one vertex of each subset. We show that solving generalized reachability games is PSPACE-complete in general. In the special case where reachability sets are singletons, the problem becomes polynomial. The case where reachability sets have size 2 is still open. We consider one-player restrictions and prove they are NP-complete and polynomial, depending on whether the player tries to ensure or to spoil the generalized reachability objectives. We also investigate memory requirements of both players.
Fichier principal
Vignette du fichier
main.pdf (93.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00525762 , version 1 (12-10-2010)
hal-00525762 , version 2 (02-02-2012)

Identifiants

Citer

Nathanaël Fijalkow, Florian Horn. The surprizing complexity of generalized reachability games. 2010. ⟨hal-00525762v1⟩

Collections

LIAFA
96 Consultations
720 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More