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 …

In order to apply formal methods in practice, the practitioner has to comprehend a vast
amount of research literature and realistically evaluate practical merits of different …

This paper focuses on reducing memory usage in enumerative model checking, while
maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree …

LNCS 7119 - A Parallel Compact Hash Table Page 1 A Parallel Compact Hash Table Steven
van der Vegt and Alfons Laarman Formal Methods and Tools, University of Twente, The …

Flash memory has become virtually indispensable in most mobile devices. In order for
mobile devices to operate successfully, it is essential that flash memory be controlled …

The limited amount of memory is the major bottleneck in model checking tools based on an
explicit states enumeration. In this context, techniques allowing an efficient representation of …

Efficiently deciding reachability for model checking problems requires storing the entire state
space. We provide an information theoretical lower bound for these storage requirements …

This paper presents the ComBack method for explicit state space exploration. The ComBack
method extends the well-known hash compaction method such that full coverage of the state …

This article discusses observations made when the state space of the 2× 2× 2 Rubik's cube
was constructed with various programs based on various data structures, gives theoretical …

This paper is concerned with a memory-efficient representation of reachability graphs. We
describe a technique that enables us to represent each reachable marking in a number of …