Distributed Explicit Bounded LTL Model Checking
Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method model checking is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this probl...
Gespeichert in:
| Veröffentlicht in: | Electronic notes in theoretical computer science Jg. 89; H. 1; S. 33 - 50 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.09.2003
|
| ISSN: | 1571-0661, 1571-0661 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Automated formal verification becomes a significant part of an industrial design process. Favourite formal verification method model checking is strongly limited by the size of the model of the verified system. It suffers from the so called state explosion problem. We propose to fight this problem by applying the idea of bounding the examined state space in explicit model checking. Moreover, we combine this approach with the distribution of the computation among the network of workstations. We consider several distributed bounded LTL model checking algorithms and carry out a series of experiments to evaluate them and to compare their behaviour. |
|---|---|
| ISSN: | 1571-0661 1571-0661 |
| DOI: | 10.1016/S1571-0661(05)80095-7 |