A new and fast variant of the strict strong coloring based graph distribution algorithm

Résumé fourni par la source

We consider the state space explosion problem which is a fundamental obstacle in formal verification of critical systems. In this paper, we propose a fast algorithm for distributing state spaces on a network of workstations. Our solution is an improvement version of SSCGDA algorithm (for Strict Strong Coloring based Graph Distribution Algorithm) which introduced the coloring concept and dominance relation in graphs for finding the good distribution of given graphs [1]. We report on a thorough experimental study to evaluate the performance of this new algorithm. The quality of the proposed algorithm is illustrated by comparison with existing algorithms.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.