Cluster-Based I/O-Efficient LTL Model Checking

被引:6
|
作者
Barnat, Jiri [1 ]
Brim, Lubos [1 ]
Simecek, Pavel [1 ]
机构
[1] Masaryk Univ, Fac Informat, Brno, Czech Republic
关键词
I/O efficient algorithms; LTL; model checking; parallel algorithms;
D O I
10.1109/ASE.2009.32
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
I/O-efficient algorithms take the advantage of large capacities of external memories to verify huge state spaces even on a single machine with low-capacity RAM. On the other hand, parallel algorithms are used to accelerate the computation and their usage may significantly increase the amount of available RAM memory if clusters of computers are involved. Since both the large amount of memory and high speed computation are desired in veri. cation of large-scale industrial systems, extending I/O-efficient model checking to work over a network of computers can bring substantial benefits. In this paper we propose an explicit state cluster-based I/O efficient LTL model checking algorithm that is capable to verify systems with approximately 10(10) states within hours.
引用
收藏
页码:635 / 639
页数:5
相关论文
共 50 条
  • [31] I/O-Efficient construction of constrained Delaunay triangulations
    Agarwal, PK
    Arge, L
    Yi, K
    ALGORITHMS - ESA 2005, 2005, 3669 : 355 - 366
  • [32] I/O-Efficient Algorithms for Graphs of Bounded Treewidth
    Anil Maheshwari
    Norbert Zeh
    Algorithmica, 2009, 54 : 413 - 469
  • [33] Efficient cluster-based portfolio optimization
    Bnouachir, Najla
    Mkhadri, Abdallah
    COMMUNICATIONS IN STATISTICS-SIMULATION AND COMPUTATION, 2021, 50 (11) : 3241 - 3255
  • [34] GraphCP: An I/O-Efficient Concurrent Graph Processing Framework
    Xu, Xianghao
    Wang, Fang
    Jiang, Hong
    Cheng, Yongli
    Feng, Dan
    Zhang, Yongxuan
    Fang, Peng
    2021 IEEE/ACM 29TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2021,
  • [35] I/O-efficient shortest path queries in geometric spanners
    Maheshwari, A
    Smid, M
    Zeh, N
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 287 - 299
  • [36] Secure Computation, I/O-Efficient Algorithms and Distributed Signatures
    Damgard, Ivan
    Kolker, Jonas
    Toft, Tomas
    TOPICS IN CRYPTOLOGY - CT-RSA 2012, 2012, 7178 : 278 - 295
  • [37] I/O-efficient algorithms for computing planar geometric spanners
    Maheshwari, Anil
    Smid, Michiel
    Zeh, Norbert
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2008, 40 (03): : 252 - 271
  • [38] I/O-Efficient Path Traversal in Succinct Planar Graphs
    Dillabaugh, Craig
    He, Meng
    Maheshwari, Anil
    Zeh, Norbert
    ALGORITHMICA, 2017, 77 (03) : 714 - 755
  • [39] LTL Model Checking Based on Binary Classification of Machine Learning
    Zhu, Weijun
    Wu, Huanmei
    Deng, Miaolei
    IEEE ACCESS, 2019, 7 : 135703 - 135719
  • [40] Worst-Case I/O-Efficient Skyline Algorithms
    Sheng, Cheng
    Tao, Yufei
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (04):