We study multiplayer quantitative reachability games played on a finite directed graph,
where the objective of each player is to reach his target set of vertices as quickly as possible …

This article investigates quantitative supervisory control with local mean payoff objectives on
discrete event systems modeled as weighted automata. Weight flows are generated as new …

This paper surveys recent advances in supervisory control theory since its 30 th anniversary
in 2017. We performed a systematic literature search and selected 272 relevant papers, with …

Abstract Consumption Markov Decision Processes (CMDPs) are probabilistic decision-
making models of resource-constrained systems. In a CMDP, the controller possesses a …

Classical reactive synthesis approaches aim to synthesize a reactive system that always
satisfies a given specifications. These approaches often reduce to playing a two-player zero …

Reachability objectives are arguably the most basic ones in the theory of games on graphs
(and beyond). But far from being bland, they constitute the cornerstone of this field …

This work introduces efficient symbolic algorithms for quantitative reactive synthesis. We
consider resource-constrained robotic manipulators that need to interact with a human to …

In this paper, we investigate the optimal robot path planning problem for high-level
specifications described by co-safe linear temporal logic (LTL) formulae. We consider the …

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 …

Shortest-path games are two-player zero-sum games played on a graph equipped with
integer weights. One player, that we call Min, wants to reach a target set of states while …