Streett Games on Finite Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Streett Games on Finite Graphs

Résumé

Streett Games are an adequate model of strong fairness in reactive systems. We show here that solving these games is co-NP complete, and that they require memory factorial in the size of the winning condition, even when the size of the game is polynomial. Two algorithms, computing the strategies of both players, are also presented.

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-00153601 , version 1 (11-06-2007)

Identifiants

  • HAL Id : hal-00153601 , version 1

Citer

Florian Horn. Streett Games on Finite Graphs. Games in Design and Verification, Jul 2005, Edimburgh, United Kingdom. ⟨hal-00153601⟩
121 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More