Model-based variable and transition orderings for efficient symbolic model checking

被引:0
|
作者
Johnston, Wendy [1 ]
Winter, Kirsten [1 ]
van den Berg, Lionel [1 ]
Strooper, Paul [1 ]
Robinson, Peter [1 ]
机构
[1] Univ Queensland, Sch ITEE, Brisbane, Qld 4072, Australia
来源
关键词
symbolic model checking; binary decision diagrams; image computation; partitioned transition relations; clustering; railway interlockings;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The symbolic model checker NuSMV has been used to check safety properties for railway interlockings. When the size of the models increased, the model checking efficiency decreased dramatically to a point at which the verification failed due to lack of memory. At that point the models we could check were still small in the real world of railway interlockings. Various standard options to the NuSMV model checker were tried, mostly without significant improvement. However, the analysis of our model provided information on how to optimise the variable orderings and also the ordering and clustering of the partitioned transition relation. The NuSMV code was adapted to enable user control for ordering and clustering of transitions. This replacement of the tool's generic algorithm improved efficiency enormously, enabling the checking of safety properties for very large models. This paper discusses how the characteristics of our model are used to find the optimised parameters.
引用
收藏
页码:524 / 540
页数:17
相关论文
共 50 条
  • [1] Model-based mutation testing via symbolic refinement checking
    Aichernig, Bernhard K.
    Joebstl, Elisabeth
    Tiran, Stefan
    SCIENCE OF COMPUTER PROGRAMMING, 2015, 97 : 383 - 404
  • [2] Exploiting partitioned transition relations for efficient symbolic model checking in CTL
    Casar, A
    Brezocnik, Z
    Kapus, T
    EUROPEAN DESIGN & TEST CONFERENCE 1996 - ED&TC 96, PROCEEDINGS, 1996, : 606 - 606
  • [3] Adaptive variable reordering for symbolic model checking
    Kamhi, G
    Fix, L
    1998 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN: DIGEST OF TECHNICAL PAPERS, 1998, : 359 - 365
  • [4] Transition-based coverage estimation for symbolic model checking
    Xu, Xingwen
    Kimura, Shinji
    Horikawa, Kazunari
    Tsuchiya, Takehiko
    ASP-DAC 2006: 11TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, PROCEEDINGS, 2006, : 1 - 6
  • [5] Efficient Refinement Checking for Model-Based Mutation Testing
    Aichernig, Bernhard K.
    Joebstl, Elisabeth
    2012 12TH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE (QSIC), 2012, : 21 - 30
  • [6] Efficient Symbolic Model Checking for Process Algebras
    Vander Meulen, Jose
    Pecheur, Charles
    FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, 2009, 5596 : 69 - 84
  • [7] Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking
    Aichernig, Bernhard K.
    Joebstl, Elisabeth
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2012, (80): : 88 - 102
  • [8] Symbolic Input-Output Conformance Checking for Model-Based Mutation Testing
    Aichernig, Bernhard K.
    Tappler, Martin
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2016, 320 : 3 - 19
  • [9] Model-Based Diagnostic using Model Checking
    Bourahla, Mustapha
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON DEPENDABILITY OF COMPUTER SYSTEMS, 2009, : 229 - 236
  • [10] Transition traversal coverage estimation for symbolic model checking
    Xu, XW
    Kimura, S
    Horikawa, K
    Tsuchiya, T
    2005 6TH INTERNATIONAL CONFERENCE ON ASIC PROCEEDINGS, BOOKS 1 AND 2, 2005, : 850 - 853