Trace Based Reachability Verification for Statecharts

被引:0
|
作者
Madhukar, Kumar [1 ]
Metta, Ravindra [1 ]
Shrotri, Ulka [1 ]
Venkatesh, R. [1 ]
机构
[1] Tata Consultancy Serv, TRDDC, Pune 411013, Maharashtra, India
关键词
DYNAMIC ABSTRACTION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Statecharts are widely used to model the behavior of reactive systems. While this visual formalism makes modeling easier, the state of the art in verification of statechart specifications is far from satisfactory due to the state explosion problem. We present History Abstraction, a trace-based verification technique to address this problem. Given a set of traces in a statechart model, the model is abstracted to contain at most three states per statechart: current, history and future. A path to a desired state in the abstract model is a sketch of a potential path to that state in the original model. We follow an incremental concretization procedure to extend the sketch to a complete path in the original model. This paper presents our technique. Our experiments suggest that the technique scales to large industry models.
引用
收藏
页码:22 / 28
页数:7
相关论文
共 50 条
  • [31] Using a process algebra interface for verification and validation of UML statecharts
    Doostali, Saeed
    Babamir, Seyed Morteza
    Javani, Mohammad
    COMPUTER STANDARDS & INTERFACES, 2023, 86
  • [32] Formal Verification of UML Statecharts using the LOTOS Formal Language
    Javani, Mohamad
    Neysiani, Behzad Soleimani
    Babamir, Seyed Morteza
    2015 2ND INTERNATIONAL CONFERENCE ON KNOWLEDGE-BASED ENGINEERING AND INNOVATION (KBEI), 2015, : 754 - 760
  • [33] Model-Based Fault Diagnosis System Verification Using Reachability Analysis
    Su, Jinya
    Chen, Wen-Hua
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2019, 49 (04): : 742 - 751
  • [34] Inner and Outer Reachability for the Verification of Control Systems
    Goubault, Eric
    Putot, Sylvie
    PROCEEDINGS OF THE 2019 22ND ACM INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (HSCC '19), 2019, : 11 - 22
  • [35] Residual Runtime Verification via Reachability Analysis
    Soueidi, Chukri
    Falcon, Ylies
    VERIFIED SOFTWARE. THEORIES, TOOLS AND EXPERIMENTS, VSTTE 2022, 2023, 13800 : 148 - 166
  • [36] Residual Runtime Verification via Reachability Analysis
    Soueidi, Chukri
    Falcone, Yliès
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023, 13800 LNCS : 148 - 166
  • [37] Safety verification and reachability analysis for hybrid systems
    Gueguen, Herve
    Lefebvre, Marie-Anne
    Zaytoon, Janan
    Nasri, Othman
    ANNUAL REVIEWS IN CONTROL, 2009, 33 (01) : 25 - 36
  • [38] DISTRIBUTED REACHABILITY ANALYSIS FOR PROTOCOL VERIFICATION ENVIRONMENTS
    AGGARWAL, S
    ALONSO, R
    COURCOUBETIS, C
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1988, 103 : 40 - 56
  • [39] Constraints for continuous reachability in the verification of hybrid systems
    Ratschan, Stefan
    She, Zhikun
    ARTIFICIAL INTELLIGENCE AND SYMBOLIC COMPUTATION, PROCEEDINGS, 2006, 4120 : 196 - 210
  • [40] Parallel Hierarchical Reachability Analysis for Analog Verification
    Lin, Honghuang
    Li, Peng
    2014 51ST ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2014,