@inproceedings{DBLP:conf/fsttcs/BouyerCFL04,
  author    = {Patricia Bouyer and
               Franck Cassez and
               Emmanuel Fleury and
               Kim Guldstrand Larsen},
  title     = {Optimal Strategies in Priced Timed Game Automata},
  booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
               Computer Science, 24th International Conference, Chennai, India, December   16-18, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3328},
  publisher = {Springer},

  pages     = {148--160},
  year      = {2004},
  urlpaper = {papers/fsttcs04.pdf},
  url_link       = {http://dx.doi.org/10.1007/978-3-540-30538-5_13},
  doi       = {10.1007/978-3-540-30538-5_13},
  Type = {B - International Conferences},
  keywords = {control, synthesis, timed games},
  abstract = {Priced timed (game) automata extend 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 and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.}
}

{"_id":"bDsBaFeP7oGvtQ6p9","bibbaseid":"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004","author_short":["Bouyer, P.","Cassez, F.","Fleury, E.","Larsen, K. G."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Patricia"],"propositions":[],"lastnames":["Bouyer"],"suffixes":[]},{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Emmanuel"],"propositions":[],"lastnames":["Fleury"],"suffixes":[]},{"firstnames":["Kim","Guldstrand"],"propositions":[],"lastnames":["Larsen"],"suffixes":[]}],"title":"Optimal Strategies in Priced Timed Game Automata","booktitle":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings","series":"Lecture Notes in Computer Science","volume":"3328","publisher":"Springer","pages":"148–160","year":"2004","urlpaper":"papers/fsttcs04.pdf","url_link":"http://dx.doi.org/10.1007/978-3-540-30538-5_13","doi":"10.1007/978-3-540-30538-5_13","keywords":"control, synthesis, timed games","abstract":"Priced timed (game) automata extend 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 and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.","bibtex":"@inproceedings{DBLP:conf/fsttcs/BouyerCFL04,\n author = {Patricia Bouyer and\n Franck Cassez and\n Emmanuel Fleury and\n Kim Guldstrand Larsen},\n title = {Optimal Strategies in Priced Timed Game Automata},\n booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical\n Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings},\n series = {Lecture Notes in Computer Science},\n volume = {3328},\n publisher = {Springer},\n\n pages = {148--160},\n year = {2004},\n urlpaper = {papers/fsttcs04.pdf},\n url_link = {http://dx.doi.org/10.1007/978-3-540-30538-5_13},\n doi = {10.1007/978-3-540-30538-5_13},\n Type = {B - International Conferences},\n keywords = {control, synthesis, timed games},\n abstract = {Priced timed (game) automata extend 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 and we prove that it is decidable. Under stronger conditions (strictness of constraints) we prove that in case an optimal strategy exists, we can compute a state-based winning optimal strategy.}\n}\n\n\n","author_short":["Bouyer, P.","Cassez, F.","Fleury, E.","Larsen, K. G."],"key":"DBLP:conf/fsttcs/BouyerCFL04","id":"DBLP:conf/fsttcs/BouyerCFL04","bibbaseid":"bouyer-cassez-fleury-larsen-optimalstrategiesinpricedtimedgameautomata-2004","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/fsttcs04.pdf"," link":"http://dx.doi.org/10.1007/978-3-540-30538-5_13"},"keyword":["control","synthesis","timed games"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F","yYF8uwWqay28JyxZC"],"keywords":["control","synthesis","timed games"],"search_terms":["optimal","strategies","priced","timed","game","automata","bouyer","cassez","fleury","larsen"],"title":"Optimal Strategies in Priced Timed Game Automata","year":2004}