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. 
DOI: 10.1007/11944836_32

6 Figures and Tables


  • Presentations referencing similar topics