A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES
Carregando...
Fonte externa
Fonte externa
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Butterworth-heinemann Ltd
Tipo
Artigo
Direito de acesso
Acesso restrito
Fonte externa
Fonte externa
Resumo
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.
Descrição
Palavras-chave
STATECHARTS, REACTIVE SYSTEMS, REACHABILITY TREE, EXHAUSTIVE SIMULATION, DYNAMIC PROPERTIES OF STATECHARTS
Idioma
Inglês
Citação
Information and Software Technology. Oxford: Butterworth-heinemann Ltd, v. 36, n. 10, p. 615-624, 1994.
