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 automata (PA) combine probability and nondeterminism. They can be given
different semantics, like strong bisimilarity, convex bisimilarity, or (more recently) distribution …

In contrast to the usual understanding of probabilistic systems as stochastic processes,
recently these systems have also been regarded as transformers of probabilities. In this …

This book discusses the semantic foundations of concurrent systems with nondeterministic
and probabilistic behaviour. Particular attention is given to clarifying the relationship …

We show a cancellation property for probabilistic choice. If distributions mu+ rho and nu+ rho
are branching probabilistic bisimilar, then distributions mu and nu are also branching …

We propose a probabilistic transition system specification format, referred to as probabilistic
RBB safe, for which rooted branching bisimulation is a congruence. The congruence …

In the setting of a simple process language featuring non-deterministic choice and a parallel
operator on the one hand and probabilistic choice on the other hand, we propose an …

Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition
systems, combine probability and nondeterminism. They can be given different semantics …

A substantial amount of today's engineering problems revolve around systems that are
concurrent and stochastic by their nature. Solution approaches attacking these problems …

Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally
proposed for Markov automata. It has gained some popularity as the coarsest behavioral …