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 data types. 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 muCRL toolset, where state values are implemented as maximally shared terms (ATerms). However, it is applicable to other models as well, e.g. PROMELA or LOTOS models. Our experiments show the trade-offs between keeping the database global, replicated or local, depending on the available network bandwidth and latency.
- parallel algorithms
- latency hiding
- EC Grant Agreement nr.: FP6/043235
- Distributed model checking
- FMT-MC: MODEL CHECKING
Blom, S., Cerna, I. (Ed.), Haverkort, B. R. H. M. (Ed.), Lisser, B., van de Pol, J. C., & Weber, M. (2009). A Database Approach to Distributed State-Space Generation. Journal of logic and computation, Advance Ac(1), 45-62. [10.1093/logcom/exp004]. https://doi.org/10.1093/logcom/exp004