34 citations · 174 across the 26 of their papers we have counts for
7 papers · 1 filter
Non-Zero Sum Games for Reactive Synthesis
Romain Brenguier, Lorenzo Clemente, Paul Hunter +5
In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution…
The Fixed Initial Credit Problem for Partial-Observation Energy Games is Ack-complete
Guillermo A. Pérez
In this paper we study two-player games with asymmetric partial observation and an energy objective. Such games are played on a weighted automaton by Eve, choosing actions, and Ada…
Minimizing Regret in Discounted-Sum Games
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal…
The First Reactive Synthesis Competition (SYNTCOMP 2014)
Swen Jacobs, Roderick Bloem, Romain Brenguier +10
We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to stimulate and guide advances in the design and application of synthesis procedures for re…
Looking at Mean-Payoff through Foggy Windows
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strat…
Quantitative Games under Failures
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +3
We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does…
Reactive Synthesis Without Regret
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Two-player zero-sum games of infinite duration and their quantitative versions are used in verification to model the interaction between a controller (Eve) and its environment (Ada…