32 citations · 172 across the 29 of their papers we have counts for
35 papers
Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player announces a strategy and Player , having several objectives, responds rat…
Automata with Timers
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet +1
In this work, we study properties of deterministic finite-state automata with timers, a subclass of timed automata proposed by Vaandrager et al. as a candidate for an efficiently l…
Validating Streaming JSON Documents with Learned VPAs
Véronique Bruyère, Guillermo A. Perez, Gaëtan Staquet
We present a new streaming algorithm to validate JSON documents against a set of constraints given as a JSON schema. Among the possible values a JSON document can hold, objects are…
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021
Swen Jacobs, Guillermo A. Perez, Remco Abraham +22
We report on the last four editions of the reactive synthesis competition (SYNTCOMP 2018-2021). We briefly describe the evaluation scheme and the experimental setup of SYNTCOMP. Th…
Stackelberg-Pareto Synthesis (Extended Version)
Véronique Bruyère, Baptiste Fievet, Jean-François Raskin +1
We study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that is an optimal r…
Pareto-Rational Verification
Véronique Bruyère, Jean-François Raskin, Clément Tamines
We study the rational verification problem which consists in verifying the correctness of a system executing in an environment that is assumed to behave rationally. We consider the…
Learning Realtime One-Counter Automata
Véronique Bruyère, Guillermo A. Pérez, Gaëtan Staquet
We present a new learning algorithm for realtime one-counter automata. Our algorithm uses membership and equivalence queries as in Angluin's L* algorithm, as well as counter value…
Stackelberg-Pareto Synthesis (Full Version)
Véronique Bruyère, Jean-François Raskin, Clément Tamines
In this paper, we study the framework of two-player Stackelberg games played on graphs in which Player 0 announces a strategy and Player 1 responds rationally with a strategy that…
Partial Solvers for Generalized Parity Games
Véronique Bruyère, Guillermo A. Pérez, Jean-François Raskin +1
Parity games have been broadly studied in recent years for their applications to controller synthesis and verification. In practice, partial solvers for parity games that execute i…
On Relevant Equilibria in Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer reachability games played on a finite directed graph equipped with target sets, one for each player. In those reachability games, it is known that there always…
Energy mean-payoff games
Véronique Bruyère, Quentin Hautem, Mickael Randour +1
In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2…
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +2
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as poss…
Constrained Existence Problem for Weak Subgame Perfect Equilibria with -Regular Boolean Objectives
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notio…
Constrained existence problem for weak subgame perfect equilibria with omega-regular Boolean objectives (full version)
Thomas Brihaye, Véronique Bruyère, Aline Goeminne +1
We study multiplayer turn-based games played on a finite directed graph such that each player aims at satisfying an omega-regular Boolean objective. Instead of the well-known notio…
Parameterized complexity of games with monotonically ordered ω-regular objectives
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
In recent years, two-player zero-sum games with multiple objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, Pla…
Computer aided synthesis: a game theoretic approach
Véronique Bruyère
In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-pla…
On the existence of weak subgame perfect equilibria
Véronique Bruyère, Stéphane Le Roux, Arno Pauly +1
We study multi-player turn-based games played on (potentially infinite) directed graphs. An outcome is assigned to every play of the game. Each player has a preference relation on…
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version)
Véronique Bruyère, Quentin Hautem, Mickael Randour
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting…
Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds
Véronique Bruyère, Quentin Hautem, Mickael Randour
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting…
On the complexity of heterogeneous multidimensional quantitative games
Véronique Bruyère, Quentin Hautem, Jean-François Raskin
In this paper, we study two-player zero-sum turn-based games played on a finite multidimensional weighted graph. In recent papers all dimensions use the same measure, whereas here…
Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability
Thomas Brihaye, Véronique Bruyère, Noémie Meunier +1
We study -player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion o…
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Aaron Bohy, Véronique Bruyère, Jean-François Raskin
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called s…
Expectations or Guarantees? I Want It All! A crossroad between games and MDPs
Véronique Bruyère, Emmanuel Filiot, Mickael Randour +1
When reasoning about the strategic capabilities of an agent, it is important to consider the nature of its adversaries. In the particular context of controller synthesis for quanti…
Secure Equilibria in Weighted Games
Véronique Bruyère, Noémie Meunier, Jean-François Raskin
We consider two-player non zero-sum infinite duration games played on weighted graphs. We extend the notion of secure equilibrium introduced by Chatterjee et al., from the Boolean…