\begin{abstract} We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain variables from unbounded domains, such as lists or other recursive datatypes. Our solution is to introduce a database which maintains a global numbering of state values. We also describe tree-compression, a technique of recursive state folding, and show that it is superior to manipulating plain state vectors. This solution is implemented and linked to the \mcrl{} toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g., PROMELA models via the NIPS virtual machine. Our experiments show the trade-offs between keeping the database global, replicated, or local, depending on the available network bandwidth and latency. \begin{keywords} state space partitioning, state collapsing, tree compression, \mcrl \end{keywords} \end{abstract}

University of Twente
J.C. van de Pol (Jaco)
CTIT Workshop Proceedings
International Workshop on Parallel and Distributed Methods in Verification
Specification and Analysis of Embedded Systems

Blom, S.C.C, Lisser, B, van de Pol, J.C, & Weber, M. (2007). A Database Approach to Distributed State Space Generation. In J.C van de Pol (Ed.), CTIT Workshop Proceedings. University of Twente.