An improved case-based approach to LTL model checking

被引:0
|
作者
Pu, Fei [1 ]
Zhang, Wenhui [1 ]
Wang, Shaochun [1 ]
机构
[1] Chinese Acad Sci, Inst Software, Comp Sci Lab, Beijing 100080, Peoples R China
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The state space explosion is the key obstacle of model checking. Even a relatively small system specification may yield a very large state space. The case-based approach based on search space partition has been proposed in [18,19] for reducing model checking complexity. This paper extends the approach by considering wider ranges of case-bases of models and multiple case-bases such that it can be applied to more types of applications. The improved approach also combines the search space partition and static analysis or expert knowledge for guaranteeing the completeness of the cases. The case study demonstrates the potential advantages of the strategy and show that the strategy may improve the efficiency of system verification and therefore scale up the applicability of the verification approach.
引用
收藏
页码:190 / 202
页数:13
相关论文
共 50 条
  • [1] A Circuit Approach to LTL Model Checking
    Claessen, Koen
    Een, Niklas
    Sterin, Baruch
    2013 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD), 2013, : 53 - 60
  • [2] A new unfolding approach to LTL model checking
    Esparza, J
    Heljanko, K
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 475 - 486
  • [3] An LTL Model Checking Approach for Biological Parameter Inference
    Gallet, Emmanuelle
    Manceny, Matthieu
    Le Gall, Pascale
    Ballarini, Paolo
    FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2014, 2014, 8829 : 155 - 170
  • [4] LTL model checking for statecharts
    Qian, Junyan
    Xu, Baowen
    Journal of Computational Information Systems, 2007, 3 (06): : 2241 - 2248
  • [5] Game Over: The Foci Approach to LTL Satisfiability and Model Checking
    Dax, Christian
    Lange, Martin
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 119 (01) : 33 - 49
  • [6] An optimal automata approach to LTL model checking of probabilistic systems
    Couvreur, JM
    Saheb, N
    Sutre, G
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2003, 2850 : 361 - 375
  • [7] Bringing LTL Model Checking to Biologists
    Ahmed, Zara
    Benque, David
    Berezin, Sergey
    Dahl, Anna Caroline E.
    Fisher, Jasmin
    Hall, Benjamin A.
    Ishtiaq, Samin
    Nanavati, Jay
    Piterman, Nir
    Riechert, Maik
    Skoblov, Nikita
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2017, 2017, 10145 : 1 - 13
  • [8] Another look at LTL model checking
    Clarke, EM
    Grumberg, O
    Hamaguchi, K
    FORMAL METHODS IN SYSTEM DESIGN, 1997, 10 (01) : 47 - 71
  • [9] Simple bounded LTL model checking
    Latvala, T
    Biere, A
    Heljanko, K
    Junttila, T
    FORMAL METHODS IN COMPUTER-AIDED DESIGN, PROCEEDINGS, 2004, 3312 : 186 - 200
  • [10] LTL Model Checking Based on Binary Classification of Machine Learning
    Zhu, Weijun
    Wu, Huanmei
    Deng, Miaolei
    IEEE ACCESS, 2019, 7 : 135703 - 135719