Reachability games with relaxed energy constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information and Computation Year : 2022

Reachability games with relaxed energy constraints


We study games with reachability objectives under energy constraints. We first prove that under strict energy constraints (either only lower-bound constraint or interval constraint), those games are LOGSPACE-equivalent to energy games with the same energy constraints but without reachability objective (i.e., for infinite runs). We then consider two relaxations of the upper-bound constraints (while keeping the lower-bound constraint strict): in the first one, called weak upper bound, the upper bound is absorbing, i.e., when the upper bound is reached, the extra energy is not stored; in the second one, we~allow for temporary violations of the upper bound, imposing limits on the number or on the amount of violations.
Fichier principal
Vignette du fichier
meangames(IC).pdf (12.79 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03482420 , version 1 (15-12-2021)





Loïc Hélouët, Nicolas Markey, Ritam Raha. Reachability games with relaxed energy constraints. Information and Computation, 2022, 285B, ⟨10.1016/j.ic.2021.104806⟩. ⟨hal-03482420⟩
30 View
15 Download



Gmail Facebook X LinkedIn More