Compositional reification of petri nets

Detalhes bibliográficos
Autor(a) principal: Menezes, Paulo Fernando Blauth
Data de Publicação: 1994
Tipo de documento: Relatório
Idioma: eng
Título da fonte: Repositório Institucional da UFRGS
Texto Completo: http://hdl.handle.net/10183/126664
Resumo: A categorical semantic domain is constructed for the reification of Petri nets based on graph transformations. First, the graph transformation concept (based on the single pushout approach) is extended for Petri nets viewed as graphs with partia! morphisms. Classes of transformations stand for reifications where part of a net (usually a transition) is replaced by another (possible complex) net allowing a hierarchical specification methodology. The composition of reifications (i.e., composition of pushouts) is defined, leading to a category of nets and reifications which is complete and cocomplete. Since the reification operation composes, the vertical compositionality requirement of Petri nets is achieved. Then , it is proven that the reification also satisfies the horizontal compositionality requirement, i.e ., the reification of nets distributes through parallel composition. Techniques for specification of nets, top down design of nets anda notion of bisimulation between unreified and reified net are provided.
id UFRGS-2_f2b32b2d31bf4b4cd3b160a4a5734cc5
oai_identifier_str oai:www.lume.ufrgs.br:10183/126664
network_acronym_str UFRGS-2
network_name_str Repositório Institucional da UFRGS
repository_id_str
spelling Menezes, Paulo Fernando Blauth2015-09-14T15:58:13Z1994http://hdl.handle.net/10183/126664000264958A categorical semantic domain is constructed for the reification of Petri nets based on graph transformations. First, the graph transformation concept (based on the single pushout approach) is extended for Petri nets viewed as graphs with partia! morphisms. Classes of transformations stand for reifications where part of a net (usually a transition) is replaced by another (possible complex) net allowing a hierarchical specification methodology. The composition of reifications (i.e., composition of pushouts) is defined, leading to a category of nets and reifications which is complete and cocomplete. Since the reification operation composes, the vertical compositionality requirement of Petri nets is achieved. Then , it is proven that the reification also satisfies the horizontal compositionality requirement, i.e ., the reification of nets distributes through parallel composition. Techniques for specification of nets, top down design of nets anda notion of bisimulation between unreified and reified net are provided.application/pdfengInstituto Superior Tecnico. Departamento de MatematicaTeoria : Ciência : ComputaçãoRedes : PetriTeoria : CategoriasPetri netsNet-based semanticsReificationVertical and horizontal compositionalityGraph transformationPartial morphismsCategory theoryCompositional reification of petri netsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/reportinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFRGSinstname:Universidade Federal do Rio Grande do Sul (UFRGS)instacron:UFRGSTEXT000264958.pdf.txt000264958.pdf.txtExtracted Texttext/plain52010http://www.lume.ufrgs.br/bitstream/10183/126664/2/000264958.pdf.txt83ca2f6dde29a902363a667acc4bca13MD52ORIGINAL000264958.pdf000264958.pdfTexto completoapplication/pdf8488782http://www.lume.ufrgs.br/bitstream/10183/126664/1/000264958.pdfcb0fa90a527e7c2c4d4905218446ef53MD51THUMBNAIL000264958.pdf.jpg000264958.pdf.jpgGenerated Thumbnailimage/jpeg1685http://www.lume.ufrgs.br/bitstream/10183/126664/3/000264958.pdf.jpg1d9b82013a2bba5287233a251b1c25dfMD5310183/1266642018-10-23 08:55:20.99oai:www.lume.ufrgs.br:10183/126664Repositório de PublicaçõesPUBhttps://lume.ufrgs.br/oai/requestopendoar:2018-10-23T11:55:20Repositório Institucional da UFRGS - Universidade Federal do Rio Grande do Sul (UFRGS)false
dc.title.pt_BR.fl_str_mv Compositional reification of petri nets
title Compositional reification of petri nets
spellingShingle Compositional reification of petri nets
Menezes, Paulo Fernando Blauth
Teoria : Ciência : Computação
Redes : Petri
Teoria : Categorias
Petri nets
Net-based semantics
Reification
Vertical and horizontal compositionality
Graph transformation
Partial morphisms
Category theory
title_short Compositional reification of petri nets
title_full Compositional reification of petri nets
title_fullStr Compositional reification of petri nets
title_full_unstemmed Compositional reification of petri nets
title_sort Compositional reification of petri nets
author Menezes, Paulo Fernando Blauth
author_facet Menezes, Paulo Fernando Blauth
author_role author
dc.contributor.author.fl_str_mv Menezes, Paulo Fernando Blauth
dc.subject.por.fl_str_mv Teoria : Ciência : Computação
Redes : Petri
Teoria : Categorias
topic Teoria : Ciência : Computação
Redes : Petri
Teoria : Categorias
Petri nets
Net-based semantics
Reification
Vertical and horizontal compositionality
Graph transformation
Partial morphisms
Category theory
dc.subject.eng.fl_str_mv Petri nets
Net-based semantics
Reification
Vertical and horizontal compositionality
Graph transformation
Partial morphisms
Category theory
description A categorical semantic domain is constructed for the reification of Petri nets based on graph transformations. First, the graph transformation concept (based on the single pushout approach) is extended for Petri nets viewed as graphs with partia! morphisms. Classes of transformations stand for reifications where part of a net (usually a transition) is replaced by another (possible complex) net allowing a hierarchical specification methodology. The composition of reifications (i.e., composition of pushouts) is defined, leading to a category of nets and reifications which is complete and cocomplete. Since the reification operation composes, the vertical compositionality requirement of Petri nets is achieved. Then , it is proven that the reification also satisfies the horizontal compositionality requirement, i.e ., the reification of nets distributes through parallel composition. Techniques for specification of nets, top down design of nets anda notion of bisimulation between unreified and reified net are provided.
publishDate 1994
dc.date.issued.fl_str_mv 1994
dc.date.accessioned.fl_str_mv 2015-09-14T15:58:13Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/report
format report
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10183/126664
dc.identifier.nrb.pt_BR.fl_str_mv 000264958
url http://hdl.handle.net/10183/126664
identifier_str_mv 000264958
dc.language.iso.fl_str_mv eng
language eng
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.publisher.none.fl_str_mv Instituto Superior Tecnico. Departamento de Matematica
publisher.none.fl_str_mv Instituto Superior Tecnico. Departamento de Matematica
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/126664/2/000264958.pdf.txt
http://www.lume.ufrgs.br/bitstream/10183/126664/1/000264958.pdf
http://www.lume.ufrgs.br/bitstream/10183/126664/3/000264958.pdf.jpg
bitstream.checksum.fl_str_mv 83ca2f6dde29a902363a667acc4bca13
cb0fa90a527e7c2c4d4905218446ef53
1d9b82013a2bba5287233a251b1c25df
bitstream.checksumAlgorithm.fl_str_mv MD5
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_ 1801224489449553920

Registros relacionados