Complexity analysis of reactive graph grammars

Detalhes bibliográficos
Autor(a) principal: Loreto, Aline Brum
Data de Publicação: 2000
Outros Autores: Toscani, Laira Vieira, Ribeiro, Leila
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UFRGS
Texto Completo: http://hdl.handle.net/10183/256164
Resumo: The aim of this paper is to present a way to calculate a complexity measurement of graph grammar specifications of reactive systems. The basic operation that describe the behavior of a graph grammar is a rule application. Therefore, this operation will be used to characterize the tasks to be performed within a system. The complexity measurement defined here ,vill give us the minimum numbei:· of steps that must be present in a computation that performs a desir_ed task.
id UFRGS-2_c23562933d2cff8f60a3b882fb6f1a55
oai_identifier_str oai:www.lume.ufrgs.br:10183/256164
network_acronym_str UFRGS-2
network_name_str Repositório Institucional da UFRGS
repository_id_str
spelling Loreto, Aline BrumToscani, Laira VieiraRibeiro, Leila2023-03-22T03:24:34Z20000103-4308http://hdl.handle.net/10183/256164000281954The aim of this paper is to present a way to calculate a complexity measurement of graph grammar specifications of reactive systems. The basic operation that describe the behavior of a graph grammar is a rule application. Therefore, this operation will be used to characterize the tasks to be performed within a system. The complexity measurement defined here ,vill give us the minimum numbei:· of steps that must be present in a computation that performs a desir_ed task.application/pdfengRevista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 109-128.Gramatica : GrafosComplexidade computacionalSistemas reativosGraph grammarsComplexityComplexity analysis of reactive graph grammarsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/otherinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT000281954.pdf.txt000281954.pdf.txtExtracted Texttext/plain50612http://www.lume.ufrgs.br/bitstream/10183/256164/2/000281954.pdf.txt7530bec4b6905a28f3326b15dd13ff69MD52ORIGINAL000281954.pdfTexto completo (inglês)application/pdf7719324http://www.lume.ufrgs.br/bitstream/10183/256164/1/000281954.pdfaf5e9db469411d12417a9e96dcb929e1MD5110183/2561642023-03-23 03:24:32.625027oai:www.lume.ufrgs.br:10183/256164Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2023-03-23T06:24:32Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false
dc.title.pt_BR.fl_str_mv Complexity analysis of reactive graph grammars
title Complexity analysis of reactive graph grammars
spellingShingle Complexity analysis of reactive graph grammars
Loreto, Aline Brum
Gramatica : Grafos
Complexidade computacional
Sistemas reativos
Graph grammars
Complexity
title_short Complexity analysis of reactive graph grammars
title_full Complexity analysis of reactive graph grammars
title_fullStr Complexity analysis of reactive graph grammars
title_full_unstemmed Complexity analysis of reactive graph grammars
title_sort Complexity analysis of reactive graph grammars
author Loreto, Aline Brum
author_facet Loreto, Aline Brum
Toscani, Laira Vieira
Ribeiro, Leila
author_role author
author2 Toscani, Laira Vieira
Ribeiro, Leila
author2_role author
author
dc.contributor.author.fl_str_mv Loreto, Aline Brum
Toscani, Laira Vieira
Ribeiro, Leila
dc.subject.por.fl_str_mv Gramatica : Grafos
Complexidade computacional
Sistemas reativos
topic Gramatica : Grafos
Complexidade computacional
Sistemas reativos
Graph grammars
Complexity
dc.subject.eng.fl_str_mv Graph grammars
Complexity
description The aim of this paper is to present a way to calculate a complexity measurement of graph grammar specifications of reactive systems. The basic operation that describe the behavior of a graph grammar is a rule application. Therefore, this operation will be used to characterize the tasks to be performed within a system. The complexity measurement defined here ,vill give us the minimum numbei:· of steps that must be present in a computation that performs a desir_ed task.
publishDate 2000
dc.date.issued.fl_str_mv 2000
dc.date.accessioned.fl_str_mv 2023-03-22T03:24:34Z
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/other
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10183/256164
dc.identifier.issn.pt_BR.fl_str_mv 0103-4308
dc.identifier.nrb.pt_BR.fl_str_mv 000281954
identifier_str_mv 0103-4308
000281954
url http://hdl.handle.net/10183/256164
dc.language.iso.fl_str_mv eng
language eng
dc.relation.ispartof.pt_BR.fl_str_mv Revista de Informatica Teorica e Aplicada. Porto Alegre. Vol. 7, n. 1 (set. 2000), p. 109-128.
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFRGS
instname:Universidade Federal do Rio Grande do Sul (UFRGS)
instacron:UFRGS
instname_str Universidade Federal do Rio Grande do Sul (UFRGS)
instacron_str UFRGS
institution UFRGS
reponame_str Repositório Institucional da UFRGS
collection Repositório Institucional da UFRGS
bitstream.url.fl_str_mv http://www.lume.ufrgs.br/bitstream/10183/256164/2/000281954.pdf.txt
http://www.lume.ufrgs.br/bitstream/10183/256164/1/000281954.pdf
bitstream.checksum.fl_str_mv 7530bec4b6905a28f3326b15dd13ff69
af5e9db469411d12417a9e96dcb929e1
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)
repository.mail.fl_str_mv
_version_ 1815447823549726720

Registros relacionados