Publication details
Parallel Breadth
-First Search LTL Model-Checking
| Basic information | |
|---|---|
| Original title: | Parallel Breadth-First Search LTL Model-Checking |
| Authors: | Jiří Barnat, Luboš Brim, Jakub Chaloupka |
| Further information | |
|---|---|
| Citation: | BARNAT, Jiří - BRIM, Luboš - CHALOUPKA, Jakub. Parallel Breadth-First Search LTL Model-Checking. In 18th IEEE International Conference on Automated Software Engineering (ASE'03). Montreal : IEEE Computer Society, 2003. ISBN 0-7695-2035-9, pp. 106-115. 2003, Montreal, Canada. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Proceedings |
| Keywords: | model checking; parallel algorithm; breadth first search |
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:
- Automated Verification of Parallel and Distributed Systems
- Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing
