Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421549 | Electronic Notes in Theoretical Computer Science | 2013 | 15 Pages |
Abstract
We extend a distributed-memory explicit-state LTL model checking algorithm (OWCTY) with hash compaction. We provide a detailed description of the improved algorithm and a correctness argument in the theoretical part of the paper. Additionally, we deliver an implementation of the algorithm as part of out parallel and distributed-memory model checker DiVinE, and use this implementation for a practical evaluation of the approach, on which we report in the experimental part of the paper.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics