par Juhl, Line;Guldstrand Larsen, K.;Raskin, Jean-François 
Référence Lecture Notes in Computer Science, 8051 LNCS, page (244-255)
Publication Publié, 2013
Référence Lecture Notes in Computer Science, 8051 LNCS, page (244-255)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Multiweighted energy games are two-player multiweighted games that concern the existence of infinite runs subject to a vector of lower and upper bounds on the accumulated weights along the run. We assume an unknown upper bound and calculate the set of vectors of upper bounds that allow an infinite run to exist. For both a strict and a weak upper bound we show how to construct this set by employing results from previous works, including an algorithm given by Valk and Jantzen for finding the set of minimal elements of an upward closed set. Additionally, we consider energy games where the weight of some transitions is unknown, and show how to find the set of suitable weights using the same algorithm. © 2013 Springer-Verlag. |
