Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/35502
- Título:
- A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES
- Universidade Estadual Paulista (UNESP)
- 0950-5849
- 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.
- 1-Out-1994
- Information and Software Technology. Oxford: Butterworth-heinemann Ltd, v. 36, n. 10, p. 615-624, 1994.
- 615-624
- Butterworth-heinemann Ltd
- STATECHARTS
- REACTIVE SYSTEMS
- REACHABILITY TREE
- EXHAUSTIVE SIMULATION
- DYNAMIC PROPERTIES OF STATECHARTS
- http://dx.doi.org/10.1016/0950-5849(94)90021-3
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/35502
Não há nenhum arquivo associado com este item.
Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.