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 …

In this article we present a comprehensive survey of various approaches for the verification
of cache coherence protocols based on state enumeration,(symbolic model checking, and …

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 …

Formal methods for the specification and verification of hardware and software systems are
becoming more and more important as systems increase in size and complexity. The aim of …

Verification by state-space exploration, also often referred to as" model checking", is an
effective method for analyzing the correctness of concurrent reactive systems (eg …

This article addresses the problem of designing memory-efficient algorithms for the
verification of temporal properties of finite-state programs. Both the programs and their …

This paper presents an algorithm for detecting deadlocks in concurrent finite-state systems
without incurring most of the state explosion due to the modeling of concurrency by …

Using elementary rigorous methods we prove the existence of a clustered phase in the
random K-SAT problem, for K≥ 8. In this phase the solutions are grouped into clusters …

Verification by state-space exploration, also often referred to as model checking, is an
effective method for analyzing the correctness of concurrent reactive systems (for instance …