Skip Navigation



Journal of Logic and Computation Advance Access published online on March 5, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp004
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blom, S.
Right arrow Articles by Weber, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

A Database Approach to Distributed State-Space Generation

Stefan Blom

Institute of Computer Science, University of Innsbruck, Austria; Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, The Netherlands.
E-mail: sccblom{at}cs.utwente.nl

Bert Lisser

Department of Software Engineering, CWI, The Netherlands.
E-mail: bert.lisser{at}cwi.nl

Jaco Van De Pol and Michael Weber

Department of Software Engineering, CWI, The Netherlands; Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente, The Netherlands.
E-mail: vdpol{at}cs.utwente.nl; michaelw{at}cs.utwente.nl

Received 29 February 2008.


  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.

Keywords: State-space partitioning; state collapsing; tree compression; µCRL


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.