State space methods are one of the most important approaches to computer-aided analysis
and verification of the behaviour of concurrent systems. In their basic form, they consist of …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

Abstract Coloured Petri Nets (CPNs) is a language for the modelling and validation of
systems in which concurrency, communication, and synchronisation play a major role …

The first technique for computing the set of transitions T to consider in a selective search
actually corresponds to a whole family of algorithms lOve81, Va191, GW91b] that have been …

We provide several notions for confluence in processes and we show how these relate to τ-
inertness, ie if then s and s′ are equivalent. Using clustered linear processes we show how …

With the advancement of computer technology, highly concurrent systems are being
developed. The verification of such systems is a challenging task, as their state space grows …

With LoLA, we put recently developed state space oriented algorithms to other tool
developers disposal. Providing a simple interface was a major design goal such that it is as …

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 …

Checking the properties of concurrent systems is an ever growing challenge. Along with the
development of improved verification methods, some critical systems that require careful …