Abstract Cadp (Construction and Analysis of Distributed Processes) is a comprehensive
software toolbox that implements the results of concurrency theory. Started in the mid 80s …

It is desirable to integrate formal verification techniques applicable to different languages.
We present Exp. Open 2.0, a new tool of the Cadp verification toolbox which combines …

Boolean equation systems (Bes s) provide a useful framework for modeling various
verification problems on finite-state concurrent systems, such as equivalence checking and …

Partial model checking was proposed by Andersen in 1995 to verify a temporal logic formula
compositionally on a composition of processes. It consists in incrementally incorporating into …

We consider the existence of a BCS superfluid phase in 6 Li due to the pairing of two
hyperfine states with unequal number of atoms. We show that the domain of existence for …

The formal methods approach to develop reliable and efficient safety-or performance-critical
systems is to construct mathematically precise models of such systems on which properties …

On-the-fly verification of concurrent finite-state systems consists in constructing and
analysing their underlying state spaces in a demand-driven way. This technique is able to …

Abstract Model checking is an increasingly popular method for verification of safety-critical
systems. The main obstacle of this verification method is a state space explosion problem …

When analyzing the behavior of finite-state concurrent systems by model checking, one way
of fighting state space explosion is to reduce the model as much as possible whilst …

This paper presents a novel technique for state space reduction of probabilistic
specifications, based on a newly developed notion of confluence for probabilistic automata …