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 条
  • [31] Reachability problems on regular ground tree rewriting graphs
    Löding, C
    THEORY OF COMPUTING SYSTEMS, 2006, 39 (02) : 347 - 383
  • [32] On some reachability problems for diffusion processes
    Menaldi, JL
    Robin, M
    OPTIMAL CONTROL AND PARTIAL DIFFERENTIAL EQUATIONS: IN HONOR OF PROFESSOR ALAIN BENSOUSSAN'S 60TH BIRTHDAY, 2001, : 394 - 403
  • [33] Reachability Problems on Regular Ground Tree Rewriting Graphs
    Christof Löding
    Theory of Computing Systems, 2006, 39 : 347 - 383
  • [34] Modeling and Analysis of a Manufacturing System with Deadlocks to Generate the Reachability Tree using Petri Net System
    Patel, Ajay M.
    Joshi, Anand Y.
    INTERNATIONAL CONFERENCE ON DESIGN AND MANUFACTURING (ICONDM2013), 2013, 64 : 775 - 784
  • [35] Timed diagnostics for reachability properties
    Tripakis, S
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 1999, 1579 : 59 - 73
  • [36] Reachability Analysis in BioAmbients
    Zavattaro, Gianluigi
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 227 (0C) : 179 - 193
  • [37] On a notion of entropy for reachability properties
    Tomar, Mahendra Singh
    Zamani, Majid
    2022 AMERICAN CONTROL CONFERENCE, ACC, 2022, : 781 - 786
  • [38] Statistical Reachability Analysis
    Lee, Seongmin
    Boehme, Marcel
    PROCEEDINGS OF THE 31ST ACM JOINT MEETING EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING, ESEC/FSE 2023, 2023, : 326 - 337
  • [39] Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis
    Lakshmi, K. Vasanta
    Acharya, Aravind
    Komondoor, Raghavan
    FM 2014: FORMAL METHODS, 2014, 8442 : 335 - 350
  • [40] Properties of reachability and almost reachability subspaces of implicit systems: The extension problem
    Eliopoulou, H
    Karcanias, N
    KYBERNETIKA, 1995, 31 (06) : 530 - 540
12345