Advertisement

Almost Optimal Strategies in One Clock Priced Timed Games

  • Patricia Bouyer
  • Kim G. Larsen
  • Nicolas Markey
  • Jacob Illum Rasmussen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4337)

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.

Keywords

Cost Function Optimal Strategy Optimal Cost Simple Game Original Game 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdeddaïm, Y., Asarin, E., Maler, O.: Scheduling with timed automata (2006)Google Scholar
  2. 2.
    Alur, R., Bernadsky, M., Madhusudan, P.: Optimal reachability in weighted timed games. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 122–133. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Alur, R., Courcoubetis, C., Henzinger, T.A.: Computing accumulated delays in real-time systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 181–193. Springer, Heidelberg (1993)Google Scholar
  4. 4.
    Alur, R., Dill, D.: A theory of timed automata. Theor. Comp. Science 126(2), 183–235 (1994)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.M.T., Vaandrager, F.W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147–161. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inf. Proc. Letters (5), 188–194 (2006)Google Scholar
  8. 8.
    Bouyer, P., Brinksma, E., Larsen, K.G.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 203–218. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Bouyer, P., Brinksma, E., Larsen, K.G.: Optimal infinite scheduling for multi-priced timed automata. Form. Meth. in Syst. Design (to appear, 2006)Google Scholar
  10. 10.
    Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 148–160. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Brihaye, T., Bruyère, V., Raskin, J.-F.: On optimal timed strategies. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 49–64. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    La Torre, S., Mukhopadhyay, S., Murano, A.: Optimal-reachability and control for acyclic weighted timed automata. In: Proc. 2nd IFIP Intl Conf. Theoretical Computer Science (IFIPTCS 2002), IFIP Conf. Proc., vol. 223, pp. 485–497. Kluwer, Dordrecht (2002)Google Scholar
  13. 13.
    Larsen, K.G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.M.T.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 493–505. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Larsen, K.G., Rasmussen, J.I.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 234–249. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Rasmussen, J.I., Larsen, K.G., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 220–235. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  16. 16.
    UPPAAL CORA (January 2006), http://www.cs.aau.dk/~behrmann/cora/

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Patricia Bouyer
    • 1
  • Kim G. Larsen
    • 2
  • Nicolas Markey
    • 1
  • Jacob Illum Rasmussen
    • 2
  1. 1.Lab. Spécification & VérificationCNRS & ENS CachanFrance
  2. 2.Department of Computer ScienceAalborg UniversityDenmark

Personalised recommendations