CORC  > 软件研究所  > 软件所图书馆  > 期刊论文
A vertex centric parallel algorithm for linear temporal logic model checking in Pregel
Xie, Miao (1) ; Yang, Qiusong (1) ; Zhai, Jian (1) ; Wang, Qing (1)
刊名Journal of Parallel and Distributed Computing
2014
卷号74期号:11页码:3161-3174
关键词Model checking Linear temporal logic Distributed memory algorithm Formal method Scalable algorithm Reliable model checker
ISSN号7437315
通讯作者Xie, M.(xiemiao@nfs.iscas.ac.cn)
中文摘要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. © 2014 Elsevier Inc.
英文摘要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. © 2014 Elsevier Inc.
收录类别SCI ; EI
语种英语
WOS记录号WOS:000342888000008
公开日期2014-12-16
内容类型期刊论文
源URL[http://ir.iscas.ac.cn/handle/311060/16795]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Xie, Miao ,Yang, Qiusong ,Zhai, Jian ,et al. A vertex centric parallel algorithm for linear temporal logic model checking in Pregel[J]. Journal of Parallel and Distributed Computing,2014,74(11):3161-3174.
APA Xie, Miao ,Yang, Qiusong ,Zhai, Jian ,&Wang, Qing .(2014).A vertex centric parallel algorithm for linear temporal logic model checking in Pregel.Journal of Parallel and Distributed Computing,74(11),3161-3174.
MLA Xie, Miao ,et al."A vertex centric parallel algorithm for linear temporal logic model checking in Pregel".Journal of Parallel and Distributed Computing 74.11(2014):3161-3174.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace