|
|||||
|
|
A probabilistic dynamic technique for the distributed generation of very large state spaces |
|
| Authors: | W J [Reference to Knottenbelt] P G [Reference to Harrison] M A [Reference to Mestern] P S [Reference to Kritzinger] |
| Affiliation: | a Department of Computing, Imperial College of Science, Technology and Medicine, 180 Queens Gate, London, SW7 2BZ, UK b Department of Computer Science, University of Cape Town, Rondebosch 7701, South Africa |
| Abstract: | Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have developed a new dynamic probabilistic state exploration algorithm which addresses this problem for general, structurally unrestricted state spaces. Our method has a low state omission probability and low memory usage that is independent of the length of the state vector. In addition, the algorithm can be easily parallelised. This combination of probability and parallelism enables us to rapidly explore state spaces that are an order of magnitude larger than those obtainable using conventional exhaustive techniques. We derive a performance model of this new algorithm in order to quantify its benefits in terms of distributed run-time, speedup and efficiency. We implement our technique on a distributed-memory parallel computer and demonstrate results which compare favourably with the performance model. Finally, we discuss suitable choices for the three hash functions upon which our algorithm is based. |
| Keywords: | State space exploration State space generation Parallel algorithm Probabilistic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |