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 tutorial provides an introduction to probabilistic model checking, a technique for
automatically verifying quantitative properties of probabilistic systems. We focus on Markov …

The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over
probabilistic models. It supports PCTL and CSL model checking, and their reward …

Because they incorporate both time-and event-driven dynamics, stochastic hybrid systems
(SHS) have become ubiquitous in a variety of fields, from mathematical finance to biological …

Dynamic fault trees (DFT) extend standard fault trees by allowing the modeling of complex
system components' behaviors and interactions. Being a high level model and easy to use …

We present MC 2, what we believe to be the first randomized, Monte Carlo algorithm for
temporal-logic model checking. Given a specification S of a finite-state system, an LTL …

Fault trees (FTs) are among the most prominent formalisms for reliability analysis of
technical systems. Dynamic FTs extend FTs with support for expressing dynamic …

We consider the problem of computing the satisfaction probability of a formula for stochastic
models with parametric uncertainty. We show that this satisfaction probability is a smooth …

Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the
reliability of computer-based systems. This paper presents a formal semantics of DFTs in …

Estimating the knee/elbow point in error curves is a challenging task. However, most of the
time these points represent ideal compromises or ideal parameters for several tasks …