Please use this identifier to cite or link to this item:
        
        
        
        http://acervodigital.unesp.br/handle/11449/35502Full metadata record
| DC Field | Value | Language | 
|---|---|---|
| dc.contributor.author | Masiero, P. C. | - | 
| dc.contributor.author | Maldonado, J. C. | - | 
| dc.contributor.author | Boaventura, I. G. | - | 
| dc.date.accessioned | 2014-05-20T15:25:01Z | - | 
| dc.date.accessioned | 2016-10-25T17:59:21Z | - | 
| dc.date.available | 2014-05-20T15:25:01Z | - | 
| dc.date.available | 2016-10-25T17:59:21Z | - | 
| dc.date.issued | 1994-10-01 | - | 
| dc.identifier | http://dx.doi.org/10.1016/0950-5849(94)90021-3 | - | 
| dc.identifier.citation | Information and Software Technology. Oxford: Butterworth-heinemann Ltd, v. 36, n. 10, p. 615-624, 1994. | - | 
| dc.identifier.issn | 0950-5849 | - | 
| dc.identifier.uri | http://hdl.handle.net/11449/35502 | - | 
| dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/35502 | - | 
| dc.description.abstract | 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. | en | 
| dc.format.extent | 615-624 | - | 
| dc.language.iso | eng | - | 
| dc.publisher | Butterworth-heinemann Ltd | - | 
| dc.source | Web of Science | - | 
| dc.subject | STATECHARTS | pt | 
| dc.subject | REACTIVE SYSTEMS | pt | 
| dc.subject | REACHABILITY TREE | pt | 
| dc.subject | EXHAUSTIVE SIMULATION | pt | 
| dc.subject | DYNAMIC PROPERTIES OF STATECHARTS | pt | 
| dc.title | A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES | en | 
| dc.type | outro | - | 
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - | 
| dc.description.affiliation | UNIV STATE SAO PAULO,UNESP,SJRP,IBILCE,DEPT COMP SCI & STAT,SAO PAULO,BRAZIL | - | 
| dc.description.affiliationUnesp | UNIV STATE SAO PAULO,UNESP,SJRP,IBILCE,DEPT COMP SCI & STAT,SAO PAULO,BRAZIL | - | 
| dc.identifier.doi | 10.1016/0950-5849(94)90021-3 | - | 
| dc.identifier.wos | WOS:A1994PL94600004 | - | 
| dc.rights.accessRights | Acesso restrito | - | 
| dc.relation.ispartof | Information and Software Technology | - | 
| Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp | |
There are no files associated with this item.
    
 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
