Parallel Exploration of State Space with Reduced Cross Transitions Partitioning
Eleazar Jiménez Serrano · 2013
We propose a method for conducting parallel state space exploration using grid computing. It is based on a partitioning method for a configuration of multiple hash tables with proven efficiency in reducing the number of address collisions and the amount of required memory. This paper presents the initial results of simulating the method, showing that for specific state spaces, it might be advantageous in reducing cross transitions and consequently reducing exploration time.