Interactive, distributed, and embedded systems often behave stochastically, for example,
when inputs, message delays, or failures conform to a probability distribution. However …

Symbolic model checking methods have been extended recently to the verification of
probabilistic systems. However, the representation of the transition matrix may be expensive …

Asynchronous stochastic systems are abundant in the real world. Examples include queuing
systems, telephone exchanges, and computer networks. Yet, little attention has been given …

Probabilistic verification of continuous-time stochastic processes has received increasing
attention in the model-checking community in the past five years, with a clear focus on …

The model-checking approach was originally formulated for verifying qualitative properties
of systems, for example safety and liveness (see Chap. 2), and subsequently extended to …

Statistical Model Checking (SMC) is a computationally very efficient verification technique
based on selective system sampling. One well identified shortcoming of SMC is that, unlike …

Probability features increasingly often in software and hardware systems: it is used in
distributed coordination and routing problems, to model fault-tolerances and performance …

We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a
temporal logic formula. This problem is at the heart of “runtime verification” but it also …

This paper studies the efficiency of several probabilistic model checkers by comparing
verification times and peak memory usage for a set of standard case studies. The study …

We introduce a framework for expressing correctness guarantees of model-checking
algorithms. The framework allows us to qualitatively compare different solution techniques …