3 citations · 5 across the 8 of their papers we have counts for
12 papers
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…
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…
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…
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…
Three Variables Suffice for Real-Time Specification
Timos Antonopoulos, Paul Hunter, Shahab Raza +1
A natural framework for real-time specification is monadic first-order logic over the structure ---the ordered real line with unary function. Our main resul…
Reachability in succinct one-counter games
Paul Hunter
We consider the reachability problem on transition systems corresponding to succinct one-counter machines, that is, machines where the counter is incremented or decremented by a va…