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...
Saved in:
| Published in: | Electronic notes in theoretical computer science Vol. 89; no. 1; pp. 33 - 50 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.09.2003
|
| ISSN: | 1571-0661, 1571-0661 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 |