B
[BLM+06] Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, and Jacob Illum Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. In FSTTCS'06, Lecture Notes in Computer Science 4337, pages 345-356. Springer-Verlag, December 2006.
Abstract

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.

@inproceedings{fsttcs2006-BLMR,
  author =              {Bouyer, Patricia and Larsen, Kim Guldstrand and
                         Markey, Nicolas and Rasmussen, Jacob Illum},
  title =               {Almost Optimal Strategies in One-Clock Priced Timed
                         Automata},
  editor =              {Arun-Kumar, S. and Garg, Naveen},
  booktitle =           {{P}roceedings of the 26th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'06)},
  acronym =             {{FSTTCS}'06},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4337},
  pages =               {345-356},
  year =                {2006},
  month =               dec,
  doi =                 {10.1007/11944836_32},
  abstract =            {We consider timed games extended with cost
                         information, and prove computability of the optimal
                         cost and of \(\epsilon\)-optimal memoryless
                         strategies in timed games with one~clock.
                         In~contrast, this problem has recently been proved
                         undecidable for timed games with three clocks.},
}
List of authors