Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …

This paper studies motion planning of a mobile robot under uncertainty. The control
objective is to synthesize a finite-memory control policy, such that a high-level task specified …

The expanding role of reinforcement learning (RL) in safety-critical system design has
promoted ω-automata as a way to express learning requirements—often non-Markovian …

Abstract (Priced) timed games are two-player quantitative games involving an environment
assumed to be completely antogonistic. Classical analysis consists in the synthesis of …

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 …

The increased interest in reactive synthesis over the last decade has led to many improved
solutions but also to many new questions. In this paper, we discuss the question of how to …

In this paper we introduce Strategy Logic with Simple Goals (SL [SG]), a fragment of Strategy
Logic that strictly extends Alternating-time Temporal Logic ATL by introducing arbitrary …

We consider the verification of multiple expected reward objectives at once on Markov
decision processes (MDPs). This enables a trade-off analysis among multiple objectives by …

Markov decision processes (MDPs) are standard models for probabilistic systems with non-
deterministic behaviours. Long-run average rewards provide a mathematically elegant …

In this invited contribution, we summarize new solution concepts useful for the synthesis of
reactive systems that we have introduced in several recent publications. These solution …