A vertex centric parallel algorithm for linear temporal logic model checking in Pregel

Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software systems, aiming at ensuring their quality. However, it is well known that LTL model checking suffers from the state explosion problem, often le...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing Jg. 74; H. 11; S. 3161 - 3174
Hauptverfasser: Xie, Miao, Yang, Qiusong, Zhai, Jian, Wang, Qing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.11.2014
Schlagworte:
ISSN:0743-7315, 1096-0848
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software systems, aiming at ensuring their quality. However, it is well known that LTL model checking suffers from the state explosion problem, often leading to insurmountable scalability problems when applying it to real-world systems. While there has been work on distributed algorithms for explicit on-the-fly LTL model checking, these are not sufficiently scalable and capable of tolerating faults during computation, significantly limiting their usefulness in huge cluster environments. Moreover, implementing these algorithms is generally viewed as a very challenging, error-prone task. In this paper, we instead rely on Pregel, a simple yet powerful model for distributed computation on large graphs. Pregel has from the start been designed for efficient, scalable and fault tolerant operation on clusters of thousands of computers, including large cloud setups. To harness Pregel’s power, we propose a new vertex centric distributed algorithm for explicit LTL model checking of concurrent systems. Experimental results illustrate feasibility and scalability of the proposed algorithm. Compared with other distributed algorithms, our algorithm is more scalable, reliable and efficient. •We propose a new vertex centric distributed algorithm for LTL model checking.•Algorithm is designed for BSP model and can be implemented in Pregel.•The whole model checking procedure can be highly paralleled by BFS.•Our algorithm is more scalable, reliable, efficient and expressive.•Our proposed algorithm opens the door to reliable model checking implementations.
AbstractList Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software systems, aiming at ensuring their quality. However, it is well known that LTL model checking suffers from the state explosion problem, often leading to insurmountable scalability problems when applying it to real-world systems. While there has been work on distributed algorithms for explicit on-the-fly LTL model checking, these are not sufficiently scalable and capable of tolerating faults during computation, significantly limiting their usefulness in huge cluster environments. Moreover, implementing these algorithms is generally viewed as a very challenging, error-prone task. In this paper, we instead rely on Pregel, a simple yet powerful model for distributed computation on large graphs. Pregel has from the start been designed for efficient, scalable and fault tolerant operation on clusters of thousands of computers, including large cloud setups. To harness Pregel’s power, we propose a new vertex centric distributed algorithm for explicit LTL model checking of concurrent systems. Experimental results illustrate feasibility and scalability of the proposed algorithm. Compared with other distributed algorithms, our algorithm is more scalable, reliable and efficient. •We propose a new vertex centric distributed algorithm for LTL model checking.•Algorithm is designed for BSP model and can be implemented in Pregel.•The whole model checking procedure can be highly paralleled by BFS.•Our algorithm is more scalable, reliable, efficient and expressive.•Our proposed algorithm opens the door to reliable model checking implementations.
Author Xie, Miao
Zhai, Jian
Wang, Qing
Yang, Qiusong
Author_xml – sequence: 1
  givenname: Miao
  surname: Xie
  fullname: Xie, Miao
  email: xiemiao@nfs.iscas.ac.cn
  organization: National Engineering Research Center of Fundamental Software, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
– sequence: 2
  givenname: Qiusong
  surname: Yang
  fullname: Yang, Qiusong
  email: qiusong@nfs.iscas.ac.cn
  organization: National Engineering Research Center of Fundamental Software, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
– sequence: 3
  givenname: Jian
  surname: Zhai
  fullname: Zhai, Jian
  email: zhaijian@nfs.iscas.ac.cn
  organization: National Engineering Research Center of Fundamental Software, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
– sequence: 4
  givenname: Qing
  surname: Wang
  fullname: Wang, Qing
  email: wq@nfs.iscas.ac.cn
  organization: National Engineering Research Center of Fundamental Software, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
BookMark eNp9kL1OwzAUhS1UJNrCCzD5BRLsOIkTiaWq-JMqwQCslmPfpA5OXDlWBW-PozIxdDrL-a7O_VZoMboRELqlJKWElnd92h-0SjNC85TwlJD6Ai0pqcuEVHm1QEvCc5ZwRosrtJqmnhBKC14t0ecGH8EH-MYKxuCNwgfppbVgsbSd8ybsB9w6j60ZQXocYDi4WMDWdbE8OB2bag_qy4wdNiN-89CBvUaXrbQT3PzlGn08Prxvn5Pd69PLdrNLVJ6TkDCW1cDbRhPNYtKGZ1VTxMW0Lcus0LWSzTy6yesWMp3lLeUl45JpWUquKrZG1emu8m6aPLRCmSCDcfEXaaygRMx-RC9mP2L2IwgX0U9Es3_owZtB-p_z0P0JgvjU0YAXkzIwKtDGgwpCO3MO_wWMDoIn
CitedBy_id crossref_primary_10_1002_cpe_4966
crossref_primary_10_1145_3604610
Cites_doi 10.1109/ASE.2003.1240299
10.1007/11804192_13
10.1016/j.procs.2012.04.026
10.1016/0890-5401(92)90017-A
10.1007/s10703-006-0009-y
10.1109/88.242438
10.1016/0020-0190(85)90024-9
10.1016/j.jpdc.2011.10.015
10.1109/ICCD.1990.130209
ContentType Journal Article
Copyright 2014 Elsevier Inc.
Copyright_xml – notice: 2014 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.jpdc.2014.07.009
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1096-0848
EndPage 3174
ExternalDocumentID 10_1016_j_jpdc_2014_07_009
S0743731514001312
GroupedDBID --K
--M
-~X
.~1
0R~
1B1
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADHUB
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
E.L
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
K-O
KOM
LG5
LG9
LY7
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SET
SEW
SPC
SPCBC
SST
SSV
SSZ
T5K
TN5
TWZ
WUQ
XJT
XOL
XPP
ZMT
ZU3
ZY4
~G-
~G0
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c440t-3329e7fbd0d3e7f1b728b58481f6625d9cab7315b49fe2d24f17637a3da6a7c83
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000342888000008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-7315
IngestDate Sat Nov 29 07:15:00 EST 2025
Tue Nov 18 22:48:39 EST 2025
Fri Feb 23 02:31:21 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 11
Keywords Model checking
Formal method
Reliable model checker
Scalable algorithm
Distributed memory algorithm
Linear temporal logic
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c440t-3329e7fbd0d3e7f1b728b58481f6625d9cab7315b49fe2d24f17637a3da6a7c83
PageCount 14
ParticipantIDs crossref_citationtrail_10_1016_j_jpdc_2014_07_009
crossref_primary_10_1016_j_jpdc_2014_07_009
elsevier_sciencedirect_doi_10_1016_j_jpdc_2014_07_009
PublicationCentury 2000
PublicationDate 2014-11-01
PublicationDateYYYYMMDD 2014-11-01
PublicationDate_xml – month: 11
  year: 2014
  text: 2014-11-01
  day: 01
PublicationDecade 2010
PublicationTitle Journal of parallel and distributed computing
PublicationYear 2014
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Barnat, Brim, Ročkai (br000045) 2009; vol. 5885
Brim, Černá, Moravec, Šimša (br000070) 2004; vol. 3312
Burch, Clarke, McMillan, Dill, Hwang (br000075) 1992; 98
Yang, Li (br000165) 2010
Reif (br000145) 1985; 20
Aggarwal, Alonso, Courcoubetis (br000005) 1987; vol. 103
J. Barnat, L. Brim, J. Chaloupka, Parallel breadth-first search LTL model-checking, in: Automated Software Engineering, 2003, Proceedings, 18th IEEE International Conference on, pp. 106–115.
Barnat, Brim, Češka, Ročkai (br000030) 2010
Aziz (br000010) 2010
Barnat, Brim, Stříbrná (br000055) 2001
Barnat, Brim, Simecek (br000050) 2009
J. Barnat, L. Brim, I. Černá, Cluster-based LTL model checking of large systems, in: Formal Methods for Components and Objects, LNCS, vol. 4111, pp. 259–279.
Barnat, Bauch, Brim, Češka (br000020) 2012; 72
Pelánek (br000135) 2007
Ranger, Raghuraman, Penmetsa, Bradski, Kozyrakis (br000140) 2007
Seo, Yoon, Kim, Jin, Kim, Maeng (br000150) 2010
Godefroid (br000100) 1996
Barnat, Bauch, Brim, Češka (br000015) 2010
Jabbar, Edelkamp (br000110) 2006; vol. 3855
Emerson (br000095) 2008
Clarke, Grumberg, Peled (br000085) 1999
Bingham, Bingham, Paula, Erickson, Singh, Reitblatt (br000065) 2010
Grama, Gupta, Kumar (br000105) 1993; 1
Krčál, Pelánek (br000120) 2001; vol. 2245
Malewicz, Austern, Bik, Dehnert, Horn, Leiser, Czajkowski (br000125) 2010
Barnat, Černá (br000060) 2006; 29
Pace (br000130) 2012; 9
Černá, Pelánek (br000080) 2003; vol. 2648
Cousot, Cousot (br000090) 1977
Valmari (br000155) 1990
S. Kimura, E. Clarke, A parallel algorithm for constructing binary decision diagrams, in: Computer Design: VLSI in Computers and Processors, 1990, ICCD ’90, Proceedings, 1990 IEEE International Conference on, pp. 220–223.
Vardi (br000160) 1996; vol. 1043
Barnat, Brim, Ročkai (br000040) 2007
Valmari (10.1016/j.jpdc.2014.07.009_br000155) 1990
Emerson (10.1016/j.jpdc.2014.07.009_br000095) 2008
Pelánek (10.1016/j.jpdc.2014.07.009_br000135) 2007
Clarke (10.1016/j.jpdc.2014.07.009_br000085) 1999
Aziz (10.1016/j.jpdc.2014.07.009_br000010) 2010
10.1016/j.jpdc.2014.07.009_br000035
Barnat (10.1016/j.jpdc.2014.07.009_br000060) 2006; 29
Barnat (10.1016/j.jpdc.2014.07.009_br000045) 2009; vol. 5885
Černá (10.1016/j.jpdc.2014.07.009_br000080) 2003; vol. 2648
10.1016/j.jpdc.2014.07.009_br000115
Barnat (10.1016/j.jpdc.2014.07.009_br000015) 2010
Vardi (10.1016/j.jpdc.2014.07.009_br000160) 1996; vol. 1043
Burch (10.1016/j.jpdc.2014.07.009_br000075) 1992; 98
Barnat (10.1016/j.jpdc.2014.07.009_br000030) 2010
Cousot (10.1016/j.jpdc.2014.07.009_br000090) 1977
Jabbar (10.1016/j.jpdc.2014.07.009_br000110) 2006; vol. 3855
Krčál (10.1016/j.jpdc.2014.07.009_br000120) 2001; vol. 2245
Reif (10.1016/j.jpdc.2014.07.009_br000145) 1985; 20
Ranger (10.1016/j.jpdc.2014.07.009_br000140) 2007
Grama (10.1016/j.jpdc.2014.07.009_br000105) 1993; 1
Yang (10.1016/j.jpdc.2014.07.009_br000165) 2010
Godefroid (10.1016/j.jpdc.2014.07.009_br000100) 1996
10.1016/j.jpdc.2014.07.009_br000025
Brim (10.1016/j.jpdc.2014.07.009_br000070) 2004; vol. 3312
Barnat (10.1016/j.jpdc.2014.07.009_br000050) 2009
Seo (10.1016/j.jpdc.2014.07.009_br000150) 2010
Barnat (10.1016/j.jpdc.2014.07.009_br000020) 2012; 72
Pace (10.1016/j.jpdc.2014.07.009_br000130) 2012; 9
Barnat (10.1016/j.jpdc.2014.07.009_br000040) 2007
Malewicz (10.1016/j.jpdc.2014.07.009_br000125) 2010
Barnat (10.1016/j.jpdc.2014.07.009_br000055) 2001
Bingham (10.1016/j.jpdc.2014.07.009_br000065) 2010
Aggarwal (10.1016/j.jpdc.2014.07.009_br000005) 1987; vol. 103
References_xml – volume: vol. 1043
  start-page: 238
  year: 1996
  end-page: 266
  ident: br000160
  article-title: An automata-theoretic approach to linear temporal logic
  publication-title: Logics for Concurrency
– volume: vol. 103
  start-page: 40
  year: 1987
  end-page: 56
  ident: br000005
  article-title: Distributed reachability analysis for protocol verification environments
  publication-title: Discrete Event Systems: Models and Applications
– start-page: 28
  year: 2010
  end-page: 36
  ident: br000065
  article-title: Industrial strength distributed explicit state model checking
  publication-title: Proceedings of the 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
– start-page: 721
  year: 2010
  end-page: 726
  ident: br000150
  article-title: HAMA: An efficient matrix computation with the MapReduce framework
  publication-title: Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science
– volume: 9
  start-page: 246
  year: 2012
  end-page: 255
  ident: br000130
  article-title: BSP vs MapReduce
  publication-title: Procedia Comput. Sci.
– start-page: 200
  year: 2001
  end-page: 216
  ident: br000055
  article-title: Distributed LTL model checking in SPIN
  publication-title: Proceedings of the 8th International SPIN Workshop on Model Checking of Software
– start-page: 345
  year: 2010
  end-page: 354
  ident: br000165
  article-title: A cut-off approach for bounded verification of parameterized systems
  publication-title: Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering—Volume 1
– start-page: 238
  year: 1977
  end-page: 252
  ident: br000090
  article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
  publication-title: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages
– volume: vol. 2648
  start-page: 49
  year: 2003
  end-page: 73
  ident: br000080
  article-title: Distributed explicit fair cycle detection
  publication-title: Model Checking Software
– reference: J. Barnat, L. Brim, J. Chaloupka, Parallel breadth-first search LTL model-checking, in: Automated Software Engineering, 2003, Proceedings, 18th IEEE International Conference on, pp. 106–115.
– start-page: 13
  year: 2007
  end-page: 24
  ident: br000140
  article-title: Evaluating MapReduce for multi-core and multiprocessor systems
  publication-title: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture
– start-page: 187
  year: 2007
  end-page: 203
  ident: br000040
  article-title: Scalable multi-core LTL model-checking
  publication-title: Proceedings of the 14th International SPIN Conference on Model Checking Software
– volume: vol. 3855
  start-page: 237
  year: 2006
  end-page: 251
  ident: br000110
  article-title: Parallel external directed model checking with linear I/O
  publication-title: Verification, Model Checking, and Abstract Interpretation
– year: 1996
  ident: br000100
  article-title: Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
– reference: S. Kimura, E. Clarke, A parallel algorithm for constructing binary decision diagrams, in: Computer Design: VLSI in Computers and Processors, 1990, ICCD ’90, Proceedings, 1990 IEEE International Conference on, pp. 220–223.
– start-page: 491
  year: 1990
  end-page: 515
  ident: br000155
  article-title: Stubborn sets for reduced state space generation
  publication-title: Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
– reference: J. Barnat, L. Brim, I. Černá, Cluster-based LTL model checking of large systems, in: Formal Methods for Components and Objects, LNCS, vol. 4111, pp. 259–279.
– year: 1999
  ident: br000085
  article-title: Model Checking
– volume: 98
  start-page: 142
  year: 1992
  end-page: 170
  ident: br000075
  article-title: Symbolic model checking: 10
  publication-title: Inform. and Comput.
– start-page: 635
  year: 2009
  end-page: 639
  ident: br000050
  article-title: Cluster-based I/O-efficient LTL model checking
  publication-title: Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
– volume: vol. 5885
  start-page: 407
  year: 2009
  end-page: 425
  ident: br000045
  article-title: A time-optimal on-the-fly parallel algorithm for model checking of weak LTL properties
  publication-title: Formal Methods and Software Engineering
– start-page: 259
  year: 2010
  end-page: 266
  ident: br000015
  article-title: Employing multiple CUDA devices to accelerate LTL model checking
  publication-title: 16th International Conference on Parallel and Distributed Systems
– volume: vol. 2245
  start-page: 96
  year: 2001
  end-page: 107
  ident: br000120
  article-title: Distributed LTL model checking based on negative cycle detection
  publication-title: FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science
– start-page: 263
  year: 2007
  end-page: 267
  ident: br000135
  article-title: BEEM: benchmarks for explicit model checkers
  publication-title: Proceedings of the 14th International SPIN Conference on Model Checking Software
– volume: 20
  start-page: 229
  year: 1985
  end-page: 234
  ident: br000145
  article-title: Depth-first search is inherently sequential
  publication-title: Inform. Process. Lett.
– start-page: 27
  year: 2008
  end-page: 45
  ident: br000095
  article-title: 25 Years of Model Checking
– volume: 72
  start-page: 1083
  year: 2012
  end-page: 1097
  ident: br000020
  article-title: Designing fast LTL model checking algorithms for many-core GPUs
  publication-title: J. Parallel Distrib. Comput.
– volume: 1
  start-page: 12
  year: 1993
  end-page: 21
  ident: br000105
  article-title: Isoefficiency: measuring the scalability of parallel algorithms and architectures
  publication-title: IEEE Parallel Distrib. Technol., Syst. Appl.
– volume: 29
  start-page: 117
  year: 2006
  end-page: 134
  ident: br000060
  article-title: Distributed breadth-first search LTL model checking
  publication-title: Form. Methods Syst. Des.
– start-page: 135
  year: 2010
  end-page: 146
  ident: br000125
  article-title: Pregel: a system for large-scale graph processing
  publication-title: Proceedings of the 2010 International Conference on Management of Data
– volume: vol. 3312
  start-page: 352
  year: 2004
  end-page: 366
  ident: br000070
  article-title: Accepting predecessors are better than back edges in distributed LTL model-checking
  publication-title: 5th International Conference on Formal Methods in Computer-Aided Design
– year: 2010
  ident: br000010
  article-title: Distributed Model Checking Using Hadoop, Technical Report, Department of Computer Science, Aalto University, Finland
– start-page: 4
  year: 2010
  end-page: 7
  ident: br000030
  article-title: DiVinE: parallel distributed model checker (Tool paper)
  publication-title: Parallel and Distributed Methods in Verification and High Performance Computational Systems Biology
– ident: 10.1016/j.jpdc.2014.07.009_br000035
  doi: 10.1109/ASE.2003.1240299
– ident: 10.1016/j.jpdc.2014.07.009_br000025
  doi: 10.1007/11804192_13
– volume: 9
  start-page: 246
  year: 2012
  ident: 10.1016/j.jpdc.2014.07.009_br000130
  article-title: BSP vs MapReduce
  publication-title: Procedia Comput. Sci.
  doi: 10.1016/j.procs.2012.04.026
– volume: vol. 3312
  start-page: 352
  year: 2004
  ident: 10.1016/j.jpdc.2014.07.009_br000070
  article-title: Accepting predecessors are better than back edges in distributed LTL model-checking
– start-page: 491
  year: 1990
  ident: 10.1016/j.jpdc.2014.07.009_br000155
  article-title: Stubborn sets for reduced state space generation
– start-page: 345
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000165
  article-title: A cut-off approach for bounded verification of parameterized systems
– volume: 98
  start-page: 142
  year: 1992
  ident: 10.1016/j.jpdc.2014.07.009_br000075
  article-title: Symbolic model checking: 1020 states and beyond
  publication-title: Inform. and Comput.
  doi: 10.1016/0890-5401(92)90017-A
– volume: 29
  start-page: 117
  year: 2006
  ident: 10.1016/j.jpdc.2014.07.009_br000060
  article-title: Distributed breadth-first search LTL model checking
  publication-title: Form. Methods Syst. Des.
  doi: 10.1007/s10703-006-0009-y
– volume: vol. 2648
  start-page: 49
  year: 2003
  ident: 10.1016/j.jpdc.2014.07.009_br000080
  article-title: Distributed explicit fair cycle detection
– volume: 1
  start-page: 12
  year: 1993
  ident: 10.1016/j.jpdc.2014.07.009_br000105
  article-title: Isoefficiency: measuring the scalability of parallel algorithms and architectures
  publication-title: IEEE Parallel Distrib. Technol., Syst. Appl.
  doi: 10.1109/88.242438
– start-page: 721
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000150
  article-title: HAMA: An efficient matrix computation with the MapReduce framework
– start-page: 135
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000125
  article-title: Pregel: a system for large-scale graph processing
– year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000010
– volume: vol. 103
  start-page: 40
  year: 1987
  ident: 10.1016/j.jpdc.2014.07.009_br000005
  article-title: Distributed reachability analysis for protocol verification environments
– start-page: 187
  year: 2007
  ident: 10.1016/j.jpdc.2014.07.009_br000040
  article-title: Scalable multi-core LTL model-checking
– start-page: 238
  year: 1977
  ident: 10.1016/j.jpdc.2014.07.009_br000090
  article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
– start-page: 28
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000065
  article-title: Industrial strength distributed explicit state model checking
– volume: vol. 2245
  start-page: 96
  year: 2001
  ident: 10.1016/j.jpdc.2014.07.009_br000120
  article-title: Distributed LTL model checking based on negative cycle detection
– volume: 20
  start-page: 229
  year: 1985
  ident: 10.1016/j.jpdc.2014.07.009_br000145
  article-title: Depth-first search is inherently sequential
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(85)90024-9
– volume: 72
  start-page: 1083
  year: 2012
  ident: 10.1016/j.jpdc.2014.07.009_br000020
  article-title: Designing fast LTL model checking algorithms for many-core GPUs
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1016/j.jpdc.2011.10.015
– volume: vol. 1043
  start-page: 238
  year: 1996
  ident: 10.1016/j.jpdc.2014.07.009_br000160
  article-title: An automata-theoretic approach to linear temporal logic
– start-page: 4
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000030
  article-title: DiVinE: parallel distributed model checker (Tool paper)
– start-page: 27
  year: 2008
  ident: 10.1016/j.jpdc.2014.07.009_br000095
– start-page: 13
  year: 2007
  ident: 10.1016/j.jpdc.2014.07.009_br000140
  article-title: Evaluating MapReduce for multi-core and multiprocessor systems
– start-page: 259
  year: 2010
  ident: 10.1016/j.jpdc.2014.07.009_br000015
  article-title: Employing multiple CUDA devices to accelerate LTL model checking
– start-page: 635
  year: 2009
  ident: 10.1016/j.jpdc.2014.07.009_br000050
  article-title: Cluster-based I/O-efficient LTL model checking
– year: 1996
  ident: 10.1016/j.jpdc.2014.07.009_br000100
– volume: vol. 5885
  start-page: 407
  year: 2009
  ident: 10.1016/j.jpdc.2014.07.009_br000045
  article-title: A time-optimal on-the-fly parallel algorithm for model checking of weak LTL properties
– year: 1999
  ident: 10.1016/j.jpdc.2014.07.009_br000085
– volume: vol. 3855
  start-page: 237
  year: 2006
  ident: 10.1016/j.jpdc.2014.07.009_br000110
  article-title: Parallel external directed model checking with linear I/O
– start-page: 200
  year: 2001
  ident: 10.1016/j.jpdc.2014.07.009_br000055
  article-title: Distributed LTL model checking in SPIN
– ident: 10.1016/j.jpdc.2014.07.009_br000115
  doi: 10.1109/ICCD.1990.130209
– start-page: 263
  year: 2007
  ident: 10.1016/j.jpdc.2014.07.009_br000135
  article-title: BEEM: benchmarks for explicit model checkers
SSID ssj0011578
Score 2.080355
Snippet Linear Temporal Logic (LTL) Model Checking is a very important and popular technique for the automatic verification of safety-critical hardware and software...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 3161
SubjectTerms Distributed memory algorithm
Formal method
Linear temporal logic
Model checking
Reliable model checker
Scalable algorithm
Title A vertex centric parallel algorithm for linear temporal logic model checking in Pregel
URI https://dx.doi.org/10.1016/j.jpdc.2014.07.009
Volume 74
WOSCitedRecordID wos000342888000008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect database
  customDbUrl:
  eissn: 1096-0848
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011578
  issn: 0743-7315
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELaqjQdegPFDjMHkB96iTHGcNPFjhYbYNKYhxqh4iRLbYSkhrbJ06n_Dv8pdbKcFVRMg8ZJUkZ2mvq93l_Pdd4S81oIpsCylz2OR-5HUsV-ERe7rkoNznILJ7UMDV2fJ-Xk6nYqL0eiHq4W5rZOmSVcrsfivooZrIGwsnf0LcQ83hQvwGYQORxA7HP9I8BMPWyzrldfnXVbSQ3bvutaYivx13lbd9fc-txD9y7z1LDdV7fVK0HTG8UCS8putdrlotc173eLEru_dKNzsMf2zdF8qt1h2zi6CRKdmI-R9lc8HTWNj1R-qJXj9w8gvtkX26QZyPw9D7TgbqGCRrdgbomeuguaXBM-eIjXhpqTzSBslHGBidGoYOJ2WNr18HBrZhs7lzNC5W_sNDlG01TaYMMXsaLZQyF3Jop61NRBrSzjkJ37Ex8KngtdPJCQCG78bJrEAtbk7OTmeng4bVSw2xt79DFuXZVIIf_-m7b7Phj9z-Yg8sDKkEwOgPTLSzWPy0DX5oFbnPyFXE2rwRC2eqJM5HfBEAU_U4Ik6PNEeT7THE3V4olVDDZ6ekk9vjy_fvPNtMw5fRlHQ-ZyHQidloQLF4cyKJEyLGJsxlGN4h1ZC5gUuQBGJUocqjEoGpivJucrHeSJT_ozsNPNGPydUpVqqhMsCoxGixHOcl1FQKjAvYzXeJ8wtUyYtUz02TKkzl5I4y3BpM1zaLMAECrFPvGHOwvC03Dk6dqufWU_TeJAZgOWOeS_-cd4Bub_-R7wkO1271K_IPXnbVTftocXUT28fpEo
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+vertex+centric+parallel+algorithm+for+linear+temporal+logic+model+checking+in+Pregel&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Xie%2C+Miao&rft.au=Yang%2C+Qiusong&rft.au=Zhai%2C+Jian&rft.au=Wang%2C+Qing&rft.date=2014-11-01&rft.pub=Elsevier+Inc&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=74&rft.issue=11&rft.spage=3161&rft.epage=3174&rft_id=info:doi/10.1016%2Fj.jpdc.2014.07.009&rft.externalDocID=S0743731514001312
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon