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 …

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 …

Classical analysis of two-player quantitative games involves an adversary (modeling the
environment of the system) which is purely antagonistic and asks for strict guarantees while …

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 …

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 …

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 …

We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from
multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the …

We study strategy synthesis for stochastic two-player games with multiple objectives
expressed as a conjunction of LTL and expected total reward goals. For stop** games, the …

We study the computational complexity of Nash equilibria in concurrent games with limit-
average objectives. In particular, we prove that the existence of a Nash equilibrium in …

We study the complexity of reachability problems on branching extensions of vector addition
systems, which allows us to derive new non-elementary complexity bounds for fragments …