A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES

被引：16
|
作者：
MASIERO, PC [1 ]
MALDONADO, JC [1 ]
BOAVENTURA, IG [1 ]
机构：
[1] UNIV STATE SAO PAULO,UNESP,SJRP,IBILCE,DEPT COMP SCI & STAT,SAO PAULO,BRAZIL
来源：
INFORMATION AND SOFTWARE TECHNOLOGY | 1994年 / 36卷 / 10期
基金：
美国国家科学基金会;
关键词：
STATECHARTS; REACTIVE SYSTEMS; REACHABILITY TREE; EXHAUSTIVE SIMULATION; DYNAMIC PROPERTIES OF STATECHARTS;
D O I：
10.1016/0950-5849(94)90021-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Statecharts are an extension to finite state machines with capability for expressing hierarchical decomposition and parallelism. They also have a mechanism called history, to remember the last visit to a superstate. An algorithm to create a reachability tree for statecharts is presented. Also shown is how to use this tree to analyse dynamic properties of statecharts; reachability from any state configuration, usage of transitions, reinitiability, deadlocks, and valid sequence of events. Owing to its powerful notation, building a reachability tree for statecharts presents some difficulties, and we show how these problems were solved in the tree we propose.
引用
收藏
页码：615 / 624
页数：10
相关论文
共 50 条
  • [1] Reachability Verification of Rhapsody Statecharts
    Madhukar, Kumar
    Metta, Ravindra
    Singh, Priyanka
    Venkatesh, R.
    IEEE SIXTH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2013), 2013, : 96 - 101
  • [2] Trace Based Reachability Verification for Statecharts
    Madhukar, Kumar
    Metta, Ravindra
    Shrotri, Ulka
    Venkatesh, R.
    2013 1ST FME WORKSHOP ON FORMAL METHODS IN SOFTWARE ENGINEERING (FORMALISE), 2013, : 22 - 28
  • [3] A Tree Structure Approach to Reachability Analysis
    Department of Molecular Sciences and Nanosystems, Università Ca’ Foscari Venezia, Italy
    不详
    arXiv, 1600,
  • [4] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, MengChu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [5] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, Mengchu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [6] Some properties of optimal ellipsoids approximating reachability sets
    Chernous'ko, FL
    Ovseevich, AI
    DOKLADY MATHEMATICS, 2003, 67 (01) : 123 - 126
  • [7] Reachability Analysis Using Message Passing over Tree Decompositions
    Sankaranarayanan, Sriram
    COMPUTER AIDED VERIFICATION (CAV 2020), PT I, 2020, 12224 : 604 - 628
  • [8] Analysis of Reachability Tree for Identification of Cyclic and Acyclic CA States
    Naskar, Nazma
    Chakraborty, Avik
    Maji, Pradipta
    Das, Sukanta
    CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 63 - 72
  • [9] A modified reachability tree approach to analysis of unbounded Petri nets
    Wang, FY
    Gao, YQ
    Zhou, MC
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01): : 303 - 308
  • [10] Reachability on suffix tree graphs
    Higa, Yasuto
    Bannai, Hideo
    Inenaga, Shunsuke
    Takeda, Masayuki
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2008, 19 (01) : 147 - 162
12345