Resumen de Dynamic properties of statecharts: a reachability tree and analysis of some properties
Paulo Cesar Masiero, Inés G. Boaventura, José Carlos Maldonado
In this paper we present an algorithm to create a reachability tree for statecharts and show how to use this tree to analyze dynamical properties of statecharts. The properties analyzed are: reachability from any state configuration, usage of transitions, deadlocks, and valid sequence of events. Statecharts are a recent extension to finite state machines with capability for expressing hierarchical decomposition and parallelism. They have also a mechanism called history, to remember the last visit to a superstate. These features make it more difficult building a reachability tree for statecharts and we show how these problems were solved in the tree we propose.
