Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …

We provide a new algorithm to determine stuttering equivalence with time complexity O (m
log n), where n is the number of states and m is the number of transitions of a Kripke …

Branching bisimilarity is a behavioural equivalence relation on labelled transition systems
(LTSs) that takes internal actions into account. It has the traditional advantage that …

We present a new distributed-memory algorithm for enumerative LTL model-checking that is
designed to be run on a cluster of workstations communicating via MPI. The detection of …

The central keywords of this thesis are “verification” and “distribution”. Verification refers to
the process of finding, by formal means, design errors in complex hardware and software …

Railway signaling is often considered as one of the most fruitful areas of intervention by
formal methods. This chapter offers insight into the actual industrial usage of formal methods …

We present a uniform signature-based approach to compute the most popular bisimulations.
Our approach is implemented symbolically using BDDs, which enables the handling of very …

The most efficient way to calculate strong bisimilarity is by finding the relational coarsest
partition of a transition system. We provide the first linear-time algorithm to calculate strong …

It is a known problem that state spaces can grow very large, which makes operating on them
(including reducing them) difficult because of operational memory shortage. In an attempt to …

Bisimilarity checking is an important operation to perform explicit-state model checking when
the state space of a model under verification has already been generated. It can be applied …