View in EDS

On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 78430053
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Barnat%2C+Jiří%22">Barnat, Jiří</searchLink><i> xbarnat@fi.muni.cz</i><br /><searchLink fieldCode="AR" term="%22Brim%2C+Luboš%22">Brim, Luboš</searchLink><i> brim@fi.muni.cz</i><br /><searchLink fieldCode="AR" term="%22Ročkai%2C+Petr%22">Ročkai, Petr</searchLink><i> xrockai@fi.muni.cz</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Science+of+Computer+Programming%22">Science of Computer Programming</searchLink>. Oct2012, Vol. 77 Issue 12, p1272-1288. 17p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Parallel+computer+program+verification%22">Parallel computer program verification</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+models%22">Mathematical models</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Problem+solving%22">Problem solving</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=78430053
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.scico.2011.03.001
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 1272
    Subjects:
      – SubjectFull: Parallel computer program verification
        Type: general
      – SubjectFull: Mathematical models
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Scalability
        Type: general
      – SubjectFull: Problem solving
        Type: general
      – SubjectFull: Machine theory
        Type: general
    Titles:
      – TitleFull: On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Barnat, Jiří
      – PersonEntity:
          Name:
            NameFull: Brim, Luboš
      – PersonEntity:
          Name:
            NameFull: Ročkai, Petr
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: issn-print
              Value: 01676423
          Numbering:
            – Type: volume
              Value: 77
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Science of Computer Programming
              Type: main
ResultId 1