Probabilistic predicates generalize standard predicates over a state space; with probabilistic
predicate transformers one thus reasons about imperative programs in terms of probabilistic …

In this thesis, we present efficient implementation techniques for probabilistic model
checking, a method which can be used to analyse probabilistic systems such as randomised …

Various formulations of non-interference have been proposed to try to characterise the
absence of information flows in system or network. There is still no consensus in the …

Parallel systems (such as operating systems, telecommunication systems, aircraft controlling
systems, banking systems, etc.) arise in many industrial applications. For applications where …

Bisimulations that abstract from internal computation have proven to be useful for verification
of compositionally defined transition system. In the literature of probabilistic extensions of …

The two models presented in this paper provide two different semantics for an extension of
Dijkstra's language of guarded commands. The extended language has an additional …

We study the combination of probability and non-determinism from a categorical point of
view. In category theory, non-determinism and probability are represented by suitable …

We survey various notions of probabilistic automata and probabilistic bisimulation,
accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this …

In this chapter I present a process algebraic approach to the modelling of security properties
and policies. I will concentrate on the concept of secrecy, also known as confidentiality, and …

Following earlier models, we lift standard deterministic and nondeterministic semantics of
imperative programs to probabilistic semantics. This semantics allows for random external …