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 Consumption Markov Decision Processes (CMDPs) are probabilistic decision-
making models of resource-constrained systems. In a CMDP, the controller possesses a …

Vector Addition Systems with States (VASS) provide a well-known and fundamental model
for the analysis of concurrent processes, parameterized systems, and are also used as …

We revisit decidability results for resource-bounded logics and use decision problems on
vector addition systems with states (VASS) in order to establish complexity characterisations …

We introduce a new setting where a population of agents, each modelled by a finite-state
system, are controlled uniformly: the controller applies the same action to every agent. The …

Graph games provide the foundation for modeling and synthesizing reactive processes. In
the synthesis of stochastic reactive processes, the traditional model is perfect-information …

We study finite-memory (FM) determinacy in games on finite graphs, a central question for
applications in controller synthesis, as FM strategies correspond to implementable …

We introduce perfect half space games, in which the goal of Player 2 is to make the sums of
encountered multi-dimensional weights diverge in a direction which is consistent with a …

The well-quasi-ordering (ie, a well-founded quasi-ordering such that all antichains are finite)
that defines well-structured transition systems (WSTS) is shown not to be the weakest …

Well-quasi-orderings (wqos)(Kruskal, 1972) are a fundamental tool in logic and computer
science. ey provide termination arguments in a large number of decidability (or finiteness …