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 …

Formal methods are increasingly being used for control and verification of dynamic systems
against complex specifications. In general, these methods rely on a relatively simple system …

This paper presents a retrospective view on probabilistic model checking. We focus on
Markov decision processes (MDPs, for short). We survey the basic ingredients of MDP …

Probabilistic model checking extends traditional model checking by incorporating
quantitative information about the probability of system transitions. However, probabilistic …

When the initial distribution and transition rates for a continuous time Markov chain are not
known precisely, robust methods are needed to study the evolution of the process in time to …

We investigate the complexity of model checking (finite) interval-valued discrete time Markov
chains, that is, discrete time Markov chains where each transition is associated with an …

Six years of doctoral research, and what an incredible ride it has been. The pages of this
dissertation are filled with the fruits of my labour, and it is my absolute pleasure that you are …

We survey the specification formalism of modal transition systems (MTS). We discuss
various extensions of MTS, their relationships and modelling capabilities. The extensions …

Markov decision processes (MDPs) are a standard model for sequential decision-making
problems and are widely used across many scientific areas, including formal methods and …

We propose two sum-product laws for imprecise Markov chains, and use these laws to
derive two algorithms to efficiently compute lower and upper expectations for imprecise …