Bibliographic Details
| Title: |
On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties |
| Authors: |
Barnat, Jiří xbarnat@fi.muni.cz, Brim, Luboš brim@fi.muni.cz, Ročkai, Petr xrockai@fi.muni.cz |
| Source: |
Science of Computer Programming. Oct2012, Vol. 77 Issue 12, p1272-1288. 17p. |
| Subjects: |
Parallel computer program verification, Mathematical models, Algorithms, Scalability, Problem solving, Machine theory |
| Abstract: |
Abstract: One of the most important open problems of parallel LTL model checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would provide the same optimality we have in sequential LTL model checking. In this paper we give a partial solution to the problem: we propose an algorithm that has the required properties for a very rich subset of LTL properties, namely those expressible by weak Büchi automata. In addition to the previous version of the paper (Barnat et al., 2009) , we demonstrate how our new algorithm can be efficiently combined with a particular parallel technique for Partial Order Reduction and report on additional experiments. [Copyright &y& Elsevier] |
|
Copyright of Science of Computer Programming is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
