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 …

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

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 …

Markov automata (MAs) extend labelled transition systems with random delays and
probabilistic branching. Action-labelled transitions are instantaneous and yield a distribution …

We study the time-bounded reachability problem for continuous-time Markov decision
processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use …

Costs and rewards are important tools for analysing quantitative aspects of models like
energy consumption and costs of maintenance and repair. Under the assumption of …

Markov automata constitute an expressive continuous-time compositional modelling
formalism, featuring stochastic timing and nondeterministic as well as probabilistic …

The content of the dissertation falls in the area of formal verification of probabilistic systems.
It comprises four parts listed below: 1. the decision problem of (probabilistic) simulation …

Costs and rewards are important tools for analysing quantitative aspects of models like
energy consumption and costs of maintenance and repair. Under the assumption of …

Today's society is characterised by the ubiquitousness of hardware and software systems on
which we rely on day in, day out. They reach from transportation systems like cars, trains and …