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 provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is $\PSPACE$-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory requirements for both players and give matching upper and lower bounds on the size of winning strategies. In order to allow more efficient algorithms, we consider subclasses of generalized reachability games. We show that bounding the size of the reachability sets gives two natural subclasses where deciding the winner can be done efficiently.
Fichier principal
Vignette du fichier
main.pdf (121.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

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-00525762v2⟩
96 Consultations
718 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More