A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
20/05/2014
20/05/2014
01/10/1994
|
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. |
Formato |
615-624 |
Identificador |
http://dx.doi.org/10.1016/0950-5849(94)90021-3 Information and Software Technology. Oxford: Butterworth-heinemann Ltd, v. 36, n. 10, p. 615-624, 1994. 0950-5849 http://hdl.handle.net/11449/35502 10.1016/0950-5849(94)90021-3 WOS:A1994PL94600004 |
Idioma(s) |
eng |
Publicador |
Butterworth-heinemann Ltd |
Relação |
Information and Software Technology |
Direitos |
closedAccess |
Palavras-Chave | #STATECHARTS #REACTIVE SYSTEMS #REACHABILITY TREE #EXHAUSTIVE SIMULATION #DYNAMIC PROPERTIES OF STATECHARTS |
Tipo |
info:eu-repo/semantics/article |