Almost Optimal Strategies in One-Clock Priced Timed Automata

Patricia Bouyer (1) , Kim Guldstrand Larsen (2) , Nicolas Markey (1) , Jacob Illum Rasmussen

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 CISS - Center for Indlejrede Software Systemer

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.

Domaines: Logique en informatique [cs.LO]

Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Markey, Jacob Illum Rasmussen. Almost Optimal Strategies in One-Clock Priced Timed Automata. Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), 2006, Kolkata, India. pp.345-356, ⟨10.1007/11944836_32⟩. ⟨hal-01194611⟩