We present automatic verification techniques for the modelling and analysis of probabilistic
systems that incorporate competitive behaviour. These systems are modelled as turn-based …

Statistical model checking (SMC) is a technique for analysis of probabilistic systems that
may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability …

PRISM-games is a tool for modelling, verification and strategy synthesis for stochastic multi-
player games. These allow models to incorporate both probability, to represent uncertainty …

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 …

In this paper, for the first time, we study the formal verification of Bayesian mechanisms
through strategic reasoning. We rely on the framework of Probabilistic Strategy Logic (PSL) …

The classical problem of reachability in simple stochastic games is typically solved by value
iteration (VI), which produces a sequence of under-approxima-tions of the value of the …

We propose novel controller synthesis techniques for probabilistic systems modelled using
stochastic two-player games: one player acts as a controller, the second represents its …

Simple stochastic games can be solved by value iteration (VI), which yields a sequence of
under-approximations of the value of the game. This sequence is guaranteed to converge to …

Cooperative multi-agent reinforcement learning (CMARL) enables agents to achieve a
common objective. However, the safety (aka robustness) of the CMARL agents operating in …

In this paper, we investigate the probabilistic variants of the strategy logics ATL and ATL*
under imperfect information. Specifically, we present novel decidability and complexity …