Parallel breadth-first search LTL model-checking

We propose a practical parallel on-the-fly algorithm for enumerative LTL (linear temporal logic) model checking. The algorithm is designed for a cluster of workstations communicating via MPI (message passing interface). The detection of cycles (faulty runs) effectively employs the so called back-lev...

Full description

Saved in:
Bibliographic Details
Published in18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings pp. 106 - 115
Main Authors Barnat, J., Brim, L., Chaloupka, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Clustering algorithms
Computer networks
Concurrent computing
Explosions
Logic
Parallel algorithms
Reachability analysis
Software engineering
State-space methods
Workstations
Online AccessGet full text
ISBN0769520359
9780769520353
ISSN1938-4300
DOI10.1109/ASE.2003.1240299

Cover

More Information
Summary:We propose a practical parallel on-the-fly algorithm for enumerative LTL (linear temporal logic) model checking. The algorithm is designed for a cluster of workstations communicating via MPI (message passing interface). 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.
ISBN:0769520359
9780769520353
ISSN:1938-4300
DOI:10.1109/ASE.2003.1240299