Software—Practice & Experience
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
What are the Limits of Model Checking Methods for the Verification of Real Life Protocols?
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Distributed State Space Generation of Discrete-State Stochastic Models
INFORMS Journal on Computing
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
Distributed analysis with µCRL: a compendium of case studies
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
An embeddable virtual machine for state space generation
Proceedings of the 14th international SPIN conference on Model checking software
DISTRIBUTOR and BCG_MERGE: tools for distributed explicit state space generation
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic Reachability for Process Algebras with Recursive Data Types
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
A Multi-Core Solver for Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards informed swarm verification
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Boosting multi-core reachability performance with shared hash tables
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Parallel recursive state compression for free
Proceedings of the 18th international SPIN conference on Model checking software
| Hi-index | 0.00 |
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.