Simple Algorithm for Simple Timed Games - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2008

Simple Algorithm for Simple Timed Games


We propose a subclass of timed game automata (TGA), called Task TGA, representing networks of communicating tasks where the system can choose when to start the task and the environment can choose the duration of the task. We search to solve finite-horizon reachability games on Task TGA by building strategies in the form of Simple Temporal Networks with Uncertainty (STNU). Such strategies have the advantage of being very succinct due to the partial order reduction of independent tasks. We show that the existence of such strategies is an NP-complete problem. A practical consequence of this result is a fully forward algorithm for building STNU strategies. Potential applications of this work are planning and scheduling under temporal uncertainty.
Fichier principal
Vignette du fichier
main_lncs.pdf (351.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00374700 , version 1 (09-04-2009)
hal-00374700 , version 2 (13-04-2009)


  • HAL Id : hal-00374700 , version 2


Yasmina Abdeddaim, Eugene Asarin, Mihaela Sighireanu. Simple Algorithm for Simple Timed Games. 2008. ⟨hal-00374700v2⟩
542 View
209 Download


Gmail Facebook X LinkedIn More