activity
20152026
most citedReal-Time Synthesis is Hard!

1 citations · 1 across the 7 of their papers we have counts for

collaborators
Showing cs.GTShow all

7 papers · 1 filter

cs.GT2024

Permissive Equilibria in Multiplayer Reachability Games

Aline Goeminne, Benjamin Monmege

We study multi-strategies in multiplayer reachability games played on finite graphs. A multi-strategy prescribes a set of possible actions, instead of a single action as usual stra…

cs.GT2024

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…

cs.GT2023

Games on Graphs: From Logic and Automata to Algorithms

Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22

The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…

cs.GT2019

Dynamics on Games: Simulation-Based Techniques and Applications to Routing

Thomas Brihaye, Gilles Geeraerts, Marion Hallet +2

We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theo…

cs.GT2018

Symbolic Approximation of Weighted Timed Games

Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the accumulated weight while reaching a…

cs.GT2017

Optimal Reachability in Divergent Weighted Timed Games

Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier

Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the ot…