In model checking, analysis algorithms are applied to large graphs (state spaces), which
model the behavior of (computer) systems. These models are typically generated from …

A distributed system is driven by separate components that are executed in parallel, and
protocols for such systems form a major aspect of system design in today's world of wireless …

We study existing parallel algorithms for the decomposition of a partitioned graph into its
strongly connected components (SCCs). In particular, we identify several individual …

Our modern society relies increasingly on the sound performance of digital systems.
Guaranteeing that these systems actually behave correctly according to their specification is …

We present a probabilistic leader election algorithm for anonymous, bidirectional,
asynchronous rings. It is based on an algorithm from Franklin 22, augmented with random …

We study distributed state space generation on a cluster of workstations. It is explained why
state space partitioning by a global hash function is problematic when states contain …

Two extensions of the partial order reduction algorithm of Clarke, Jha and Marrero are
presented. The proposed algorithms are suitable for branching security protocols, eg …

We study distributed state-space generation on a cluster of workstations. It is explained why
state-space partitioning by a global hash function is problematic when states contain …

The GPU acceleration of explicit state space exploration, for explicit-state model checking,
has been the subject of previous research, but to date, the tools have been limited in their …

THIS THESIS DEALS WITH THE incorporation of timing aspects in (mostly) explicit state
model checking. Therefore, time as a concept appears everywhere in the thesis, whether as …