@techreport{ bouyer-brics-04,
  abstract = {  Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on
  reachability games for priced timed game automata and prove that the
  optimal cost for winning such a game is computable under conditions
  concerning the
  non-zenoness of cost. Under stronger conditions (strictness of
  constraints) we prove in addition that it is decidable whether there
  is an optimal strategy in which case an optimal strategy can be
  computed. Our results extend previous decidability result which
  requires the underlying game automata to be acyclic. Finally, our
  results are encoded in a first prototype in {\em HyTech} which is applied
  on a small case-study.},
  author = {Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim Guldstrand},
  institution = {BRICS, Denmark},
  lex = {Da},
  xxmonth = {February},
  note = {ISSN 0909-0878},
  category = {control},
  number = {RS-04-0},
  title = {{Optimal Strategies in Priced Timed Game Automata}},
  type = {BRICS Reports Series},
  url = {http://www.brics.dk/RS/04/4/},
  year = {2004}
}

{"_id":"Rj86EYpKQRA3vgwA4","bibbaseid":"bouyer-cassez-fleury-larsen-guldstrand-optimalstrategiesinpricedtimedgameautomata-2004","downloads":0,"creationDate":"2015-03-18T11:11:41.517Z","title":"Optimal Strategies in Priced Timed Game Automata","author_short":["Bouyer, P.","Cassez, F.","Fleury, E.","Larsen","Guldstrand, K."],"year":2004,"bibtype":"techreport","biburl":"http://www.irccyn.fr/franck/bib/mabib.bib","bibdata":{"abstract":"Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on reachability games for priced timed game automata and prove that the optimal cost for winning such a game is computable under conditions concerning the non-zenoness of cost. Under stronger conditions (strictness of constraints) we prove in addition that it is decidable whether there is an optimal strategy in which case an optimal strategy can be computed. Our results extend previous decidability result which requires the underlying game automata to be acyclic. Finally, our results are encoded in a first prototype in \\em HyTech which is applied on a small case-study.","author":["Bouyer, Patricia","Cassez, Franck","Fleury, Emmanuel","Larsen","Guldstrand, Kim"],"author_short":["Bouyer, P.","Cassez, F.","Fleury, E.","Larsen","Guldstrand, K."],"bibtex":"@techreport{ bouyer-brics-04,\n abstract = { Priced timed (game) automata extends timed (game) automata with costs on both locations and transitions. In this paper we focus on\n reachability games for priced timed game automata and prove that the\n optimal cost for winning such a game is computable under conditions\n concerning the\n non-zenoness of cost. Under stronger conditions (strictness of\n constraints) we prove in addition that it is decidable whether there\n is an optimal strategy in which case an optimal strategy can be\n computed. Our results extend previous decidability result which\n requires the underlying game automata to be acyclic. Finally, our\n results are encoded in a first prototype in {\\em HyTech} which is applied\n on a small case-study.},\n author = {Bouyer, Patricia and Cassez, Franck and Fleury, Emmanuel and Larsen, Kim Guldstrand},\n institution = {BRICS, Denmark},\n lex = {Da},\n xxmonth = {February},\n note = {ISSN 0909-0878},\n category = {control},\n number = {RS-04-0},\n title = {{Optimal Strategies in Priced Timed Game Automata}},\n type = {BRICS Reports Series},\n url = {http://www.brics.dk/RS/04/4/},\n year = {2004}\n}","bibtype":"techreport","category":"control","id":"bouyer-brics-04","institution":"BRICS, Denmark","key":"bouyer-brics-04","lex":"Da","note":"ISSN 0909-0878","number":"RS-04-0","title":"Optimal Strategies in Priced Timed Game Automata","type":"BRICS Reports Series","url":"http://www.brics.dk/RS/04/4/","xxmonth":"February","year":"2004","bibbaseid":"bouyer-cassez-fleury-larsen-guldstrand-optimalstrategiesinpricedtimedgameautomata-2004","role":"author","urls":{"Paper":"http://www.brics.dk/RS/04/4/"},"downloads":0},"search_terms":["optimal","strategies","priced","timed","game","automata","bouyer","cassez","fleury","larsen","guldstrand"],"keywords":[],"authorIDs":["55095a39df05089b6e000283"],"dataSources":["YiaWb6rdBC8TdWyXv"]}