Joyce—a programming language for distributed systems
Software—Practice & Experience
Automated parallelization of discrete state-space generation
Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
Communicating sequential processes
Communications of the ACM
A Discipline of Programming
Coverage Preserving Reduction Strategies for Reachability Analysis
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Distributed-Memory Model Checking with SPIN
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Runtime Efficient State Compaction in SPIN
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parallelizing the Murphi Verifier
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
| Hi-index | 0.00 |
We examine the distributed breadth-first enumeration of a state space that is partitioned using a static partition function. Two of the key drawbacks of this approach are the high communication overhead and the excessive growth of the queues that hold states received from other nodes, ultimately resulting in memory exhaustion that causes premature termination of the distributed enumeration algorithm. This paper investigates a number of strategies to reduce communication times and queue lengths. Some aspects of the strategies are novel, including a local search technique, while others are standard techniques for reducing memory usage and time for both serial and parallel state enumeration algorithms. The queue reduction strategies effectively reduce the queue lengths and save memory, while the standard techniques outperform the other strategies in their effectiveness to reduce communication overhead.