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.

Authors

• Yasmina Abdeddaïm
• Eugene Asarin
• Mihaela Sighireanu

Keywords

• Automata
• Game theory
• Uncertainty
• Job shop scheduling
• Control system synthesis
• Timing
• Explosions
• Strategic planning
• Automatic control
• NP-complete problem
• Simple Game
• Partial Order
• Temporal Uncertainty
• Semantic
• Horizon
• Upper Bound
• Discrete Variables
• Number Of Time Points
• Discrete Choice
• Local Constraints
• Safety Constraints
• Polynomial Number
• reachability games
• temporal uncertainity
• timed game automata
• STNU