par Brim, Lubos;Chaloupka, Jakub;Doyen, Laurent 
;Gentilini, Raffaella ;Raskin, Jean-François
Référence Formal methods in system design, 38, 2, page (97-118)
Publication Publié, 2012
;Gentilini, Raffaella ;Raskin, Jean-François Référence Formal methods in system design, 38, 2, page (97-118)
Publication Publié, 2012
Article révisé par les pairs
| Résumé : | In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff algorithms. Our algorithm can also be combined with the procedure by Andersson and Vorobyov to obtain a randomized algorithm with currently the best expected time complexity. The proposed solution relies on a simple fixpoint iteration to solve the log-space equivalent problem of deciding the winner of energy games. Our results imply also that energy games and mean-payoff games can be reduced to safety games in pseudopolynomial time. © 2010 Springer Science+Business Media, LLC. |
