Almost Optimal Strategies in One Clock Priced Timed Games

We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.

• Type: Conference
• Year: 2006
• Where: FSTTCS
• Authors: Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen
• Keywords: -optimal Memoryless Strategies, FSTTCS 2006, Optimal Cost, Software Engineering, Timed Games