Parallel Breadth-First Search in LTL Model-Checking

Mgr. Jiří Barnat, Ph.D.

Rigorózní práce

Abstract:

A new parallel on-the-fly algorithm for enumerative LTL model checking is proposed. The algorithm is designed for networks 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 all back-level edges, and for each level the back-level edges are checked in parallel by a nested search procedure 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. An experimental evaluation of the algorithm is given as well.

Klíčová slova

LTL model checking, cluster, distributed memory, parallel

Jazyk práce: čeština

Datum vytvoření / odevzdání či podání práce: 27. 4. 2006

Obhajoba závěrečné práce

• Obhajoba proběhla 27. 4. 2006

Masarykova univerzita

Fakulta informatiky

Rigorózní řízení / obor:
Informatika / Informatika