4 citations · 5 across the 7 of their papers we have counts for
8 papers
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…
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…
Synthesis of Robust Optimal Strategies in Weighted Timed Games
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. The synthesized strategies rely on a perfe…
Counterfactual Causality for Reachability and Safety based on Distance Functions
Julie Parreaux, Jakob Piribauer, Christel Baier
Investigations of causality in operational systems aim at providing human-understandable explanations of why a system behaves as it does. There is, in particular, a demand to expla…
Counterfactual Causality for Reachability and Safety based on Distance Functions
Julie Parreaux, Jakob Piribauer, Christel Baier
Investigations of causality in operational systems aim at providing human-understandable explanations of why a system behaves as it does. There is, in particular, a demand to expla…
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. Unfortunately, they are notoriously diffic…
Playing Stochastically in Weighted Timed Games to Emulate Memory
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the playe…
Reaching Your Goal Optimally by Playing at Random
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Shortest-path games are two-player zero-sum games played on a graph equipped with integer weights. One player, that we call Min, wants to reach a target set of states while minimis…