Parallel Breadth-First Search LTL Model-Checking

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BARNAT Jiří BRIM Luboš CHALOUPKA Jakub

Year of publication 2003
Type Article in Proceedings
Conference 18th IEEE International Conference on Automated Software Engineering (ASE'03)
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords model checking; parallel algorithm; breadth first search
Description We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so called back-level edges. In particular, a parallel level-synchronized breadth-first search of the graph is performed to discover back-level edges. For each level the back-level edges are checked in parallel by a nested depth-first search to confirm or refute the presence of a cycle. Several optimizations of the basic algorithm are presented and advantages and drawbacks of their application to distributed LTL model checking are discussed. Experimental implementation of the algorithm shows promising results.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.