4 citations · 4 across the 4 of their papers we have counts for
2 papers
cs.GT2026
Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games
Nathalie Bertrand, Maëlle Gautrin, Julie Parreaux
The value problem for 2-player games on graph generally consists in determining the minimal value Min can ensure against any possible strategy for Max. We consider here the value p…
cs.FL2026
One-clock synthesis problems
Sławomir Lasota, Mathieu Lehaut, Julie Parreaux +1
We study a generalisation of Büchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton, and one of the players can elaps…