Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

Most specification languages express only qualitative constraints. However, among two
implementations that satisfy a given specification, one may be preferred to another. For …

We present a constraint-based approach to computing winning strategies in two-player
graph games over the state space of infinite-state programs. Such games have numerous …

Recently, there has been an effort to add quantitative objectives to formal verification and
synthesis. We introduce and investigate the extension of temporal logics with quantitative …

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 …

Abstract Systems should not only be correct but also robust in the sense that they behave
reasonably in unexpected situations. This article addresses synthesis of robust reactive …

Energy games have recently attracted a lot of attention. These are games played on finite
weighted automata and concern the existence of infinite runs subject to boundary …

Multi-dimensional mean-payoff and energy games provide the mathematical foundation for
the quantitative study of reactive systems, and play a central role in the emerging …

In two-player games on graphs, the simplest possible strategies are those that can be
implemented without any memory. These are called positional strategies. In this paper, we …

We propose a general framework for modelling and formal reasoning about multi-agent
systems and, in particular, multi-stage games where both quantitative and qualitative …