Formal Verification of Hierarchical Ptolemy II Synchronous-Reactive Models with Bounded Model Checking

被引:0
|
作者
Zhang, Xiaozhen [1 ]
Yang, Zhaoming [1 ]
Kong, Hui [2 ]
Kong, Weiqiang [1 ]
机构
[1] Dalian Univ Technol, Dalian, Liaoning, Peoples R China
[2] Huawei Technol Co Ltd, Shanghai, Peoples R China
关键词
Hierarchical synchronous-reactive models; Bounded Model Checking; k-induction; Ptolemy II; formal verification; INTERPOLATION;
D O I
10.1109/QRS57517.2022.00049
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Ptolemy II is an open-source modeling and simulation tool for concurrent, real-time and embedded systems, particularly those involving hierarchical heterogeneity. Synchronous-reactive (SR) model of computation which has been implemented in Ptolemy II is commonly used to design safety-critical systems with complicated control logic. Formally verifying the correctness of hierarchical SR models is of great importance and also challenging due to the formalization of a series of specific features including, e.g., instantaneous communication between actors across the level of hierarchy, the combination of SR's fixed-point semantic with hierarchical structure, and multiple clocks proceeding at different rates in multiclock SR models. In this paper, we tackle such challenges and propose a bounded model checking (BMC) approach to typical actors commonly used in hierarchical SR models. In addition, we implement the proposed BMC approach to hierarchical SR models in a prototype tool called Ptolemy-Z3, which has been integrated into the Ptolemy II environment. Experimental results show that Ptolemy-Z3 outperforms significantly Ptolemy-NuSMV (a verification tool provided by the Ptolemy II environment) in the verification capability of hierarchical SR models.
引用
收藏
页码:410 / 421
页数:12
相关论文
共 50 条
  • [41] Automated verification of concurrent go programs via bounded model checking
    Dilley, Nicolas
    Lange, Julien
    AUTOMATED SOFTWARE ENGINEERING, 2023, 30 (02)
  • [42] Application of symbolic and bounded model checking to the verification of logic control systems
    Loeis, Kingliana
    Younis, Mohammed Bani
    Frey, Georg
    ETFA 2005: 10TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 1, PTS 1 AND 2, PROCEEDINGS, 2005, : 247 - 250
  • [43] Achieving completeness in the verification of action theories by Bounded Model Checking in ASP
    Giordano, Laura
    Martelli, Alberto
    Dupre, Daniele Theseider
    JOURNAL OF LOGIC AND COMPUTATION, 2015, 25 (06) : 1307 - 1330
  • [44] Efficient SAT-based bounded model checking for software verification
    Ivancic, Franio
    Yang, Zijiang
    Ganai, Malay K.
    Gupta, Aarti
    Ashar, Pranav
    THEORETICAL COMPUTER SCIENCE, 2008, 404 (03) : 256 - 274
  • [45] Verification of multi-agent systems via bounded model checking
    Luo, Xiangyu
    Su, Kaile
    Sattar, Abdul
    Reynolds, Mark
    AI 2006: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4304 : 69 - +
  • [46] Automated verification of concurrent go programs via bounded model checking
    Nicolas Dilley
    Julien Lange
    Automated Software Engineering, 2023, 30
  • [47] A Candid Industrial Evaluation of Formal Software Verification using Model Checking
    Bennion, Matthew
    Habli, Ibrahim
    36TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE COMPANION 2014), 2014, : 175 - 184
  • [48] Comparative Analysis of Formal Model Checking Tools for Security Protocol Verification
    Patel, Reema
    Borisaniya, Bhavesh
    Patel, Avi
    Patel, Dhiren
    Rajarajan, Muttukrishnan
    Zisman, Andrea
    RECENT TRENDS IN NETWORK SECURITY AND APPLICATIONS, 2010, 89 : 152 - +
  • [49] Formal Verification of a Partial-Order Reduction Technique for Model Checking
    Ching-Tsun Chou
    Doron Peled
    Journal of Automated Reasoning, 1999, 23 : 265 - 298
  • [50] Formal Verification of Blockchain Smart Contracts via ATL Model Checking
    Nam, Wonhong
    Kil, Hyunyoung
    IEEE ACCESS, 2022, 10 : 8151 - 8162