A Database Approach to Distributed State-Space Generation
Citations Over TimeTop 10% of 2009 papers
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 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 µCRL 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.
Related Papers
- → Comparison of the NCI Open Database with Seven Large Chemical Structural Databases(2001)217 cited
- → Incremental Data Migration for Multi-database Systems Based on MySQL with Spider Storage Engine(2014)2 cited
- Present a New Middleware to Control and Management Database Distributed Environment(2013)
- → Drug information through online databases : a comparison between external databases and the in-house database of a pharmaceutical company(1991)1 cited
- Technique in Distributed Technique in Distributed Technique in Distributed Technique in Distributed Database System Database System Database System Database System(2013)