Logotipo do repositório
 

Publicação:
A REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIES

Página do item simplificado
dc.contributor.authorMasiero, P. C.
dc.contributor.authorMaldonado, J. C.
dc.contributor.authorBoaventura, I. G.
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:25:01Z
dc.date.available2014-05-20T15:25:01Z
dc.date.issued1994-10-01
dc.description.abstractStatecharts 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.description.affiliationUNIV STATE SAO PAULO,UNESP,SJRP,IBILCE,DEPT COMP SCI & STAT,SAO PAULO,BRAZIL
dc.description.affiliationUnespUNIV STATE SAO PAULO,UNESP,SJRP,IBILCE,DEPT COMP SCI & STAT,SAO PAULO,BRAZIL
dc.format.extent615-624
dc.identifierhttp://dx.doi.org/10.1016/0950-5849(94)90021-3
dc.identifier.citationInformation and Software Technology. Oxford: Butterworth-heinemann Ltd, v. 36, n. 10, p. 615-624, 1994.
dc.identifier.doi10.1016/0950-5849(94)90021-3
dc.identifier.issn0950-5849
dc.identifier.urihttp://hdl.handle.net/11449/35502
dc.identifier.wosWOS:A1994PL94600004
dc.language.isoeng
dc.publisherButterworth-heinemann Ltd
dc.relation.ispartofInformation and Software Technology
dc.relation.ispartofjcr2.627
dc.relation.ispartofsjr0,581
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.subjectSTATECHARTSpt
dc.subjectREACTIVE SYSTEMSpt
dc.subjectREACHABILITY TREEpt
dc.subjectEXHAUSTIVE SIMULATIONpt
dc.subjectDYNAMIC PROPERTIES OF STATECHARTSpt
dc.titleA REACHABILITY TREE FOR STATECHARTS AND ANALYSIS OF SOME PROPERTIESen
dc.typeArtigo
dcterms.licensehttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dcterms.rightsHolderButterworth-heinemann Ltd
dspace.entity.typePublication
unesp.author.orcid0000-0002-2541-4045[1]
unesp.author.orcid0000-0002-3779-7143[2]
unesp.campusUniversidade Estadual Paulista (UNESP), Instituto de Biociências Letras e Ciências Exatas, São José do Rio Pretopt
unesp.departmentCiências da Computação e Estatística - IBILCEpt

Arquivos

Licença do Pacote

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:

Coleções

São José do Rio Preto - IBILCE - Instituto de Biociências, Letras e Ciências Exatas