For decades, two-player (antagonistic) games on graphs have been a framework of choice
for many important problems in theoretical computer science. A notorious one is controller …

We study two-player stochastic games, where the goal of one player is to satisfy a formula
given as a positive boolean combination of expected total reward objectives and the …

We study turn-based stochastic zero-sum games with lexicographic preferences over
objectives. Stochastic games are standard models in control, verification, and synthesis of …

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-player …

We study turn-based stochastic zero-sum games with lexicographic preferences over
reachability and safety objectives. Stochastic games are standard models in control …

We consider two-player games played on weighted directed graphs with mean-payoff and
total-payoff objectives, two classical quantitative objectives. While for single-dimensional …

Classical objectives in two-player zero-sum games played on graphs often deal with limit
behaviors of infinite plays: eg, mean-payoff and total-payoff in the quantitative setting, or …

Two-player turn-based zero-sum games on (finite or infinite) graphs are a central framework
in theoretical computer science-notably as a tool for controller synthesis, but also due to their …

We consider two-player games over graphs and give tight bounds on the memory size of
strategies ensuring safety objectives. More specifically, we show that the minimal number of …

Given a model of a system and an objective, the model-checking question asks whether the
model satisfies the objective. We study polynomial-time problems in two classical models …