Model checking statecharts based on conditional term rewriting systems

被引:0
|
作者
Kwon, G [1 ]
机构
[1] Kyonggi Univ, Dept Comp Sci, Suwon, South Korea
关键词
formal verification; model checking; SMV; statecharts; term rewriting system; operational semantics;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Formal verification of statecharts with the use of current model checking techniques is the main concern of this paper. To model check it, however, its description has to be translated into the input language of the model checker. This paper describes how statecharts can be translated into SMV to allow for branching time model checking of statecharts. To reflect statecharts as close as in SMV, we encoded statecharts as conditional rewrite rules which serves as a bridge between them. We defined its operational semantics which guides the correct translation. This paper also described the translation techniques of advanced features of statecharts such as history states and conflict resolutions.
引用
收藏
页码:1179 / 1185
页数:7
相关论文
共 50 条
  • [41] Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems
    Lucas, Salvador
    Meseguer, Jose
    Gutierrez, Raul
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2014), 2015, 8981 : 113 - 130
  • [42] Natural rewriting for general term rewriting systems
    Escobar, S
    Meseguer, J
    Thati, P
    LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2005, 3573 : 101 - 116
  • [43] Translating logic programs into conditional rewriting systems
    vanRaamsdonk, F
    LOGIC PROGRAMMING: PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1997, : 168 - 182
  • [44] Generation of the Path to Counter-Examples by Backward State Space Traversal in Symbolic Model Checking Based on Term Rewriting
    Pura, Mihai Lica
    Morogan, Luciana
    Buchs, Didier
    2016 INTERNATIONAL CONFERENCE ON COMMUNICATIONS (COMM 2016), 2016, : 85 - 88
  • [45] Confluence proofs of term rewriting systems based on persistency
    1600, Japan Society for Software Science and Technology (30):
  • [46] A MODEL FOR DISTRIBUTED SYSTEMS BASED ON GRAPH REWRITING
    DEGANO, P
    MONTANARI, U
    JOURNAL OF THE ACM, 1987, 34 (02) : 411 - 449
  • [47] Term Orderings for Non-reachability of (Conditional) Rewriting
    Yamada, Akihisa
    AUTOMATED REASONING, IJCAR 2022, 2022, 13385 : 248 - 267
  • [48] Conditional Commitments: Reasoning and Model Checking
    El Kholy, Warda
    Bentahar, Jamal
    El Menshawy, Mohamed
    Qu, Hongyang
    Dssouli, Rachida
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2014, 24 (02)
  • [49] From the specification of multiagent systems by statecharts to their formal analysis by model checking: Towards safety-critical applications
    Stolzenburg, F
    Arai, T
    MULTIAGENT SYSTEM TECHNOLOGIES, PROCEEDINGS, 2003, 2831 : 131 - 143
  • [50] CONDITIONAL REWRITING LOGIC AS A UNIFIED MODEL OF CONCURRENCY
    MESEGUER, J
    THEORETICAL COMPUTER SCIENCE, 1992, 96 (01) : 73 - 155