Show simple item record

dc.contributor.authorMenezes, Paulo Fernando Blauthpt_BR
dc.date.accessioned2015-09-14T15:58:13Zpt_BR
dc.date.issued1994pt_BR
dc.identifier.urihttp://hdl.handle.net/10183/126664pt_BR
dc.description.abstractA 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.en
dc.format.mimetypeapplication/pdf
dc.language.isoengpt_BR
dc.publisherInstituto Superior Tecnico. Departamento de Matematicapt_BR
dc.rightsOpen Accessen
dc.subjectPetri netsen
dc.subjectTeoria : Ciência : Computaçãopt_BR
dc.subjectRedes : Petript_BR
dc.subjectNet-based semanticsen
dc.subjectTeoria : Categoriaspt_BR
dc.subjectReificationen
dc.subjectVertical and horizontal compositionalityen
dc.subjectGraph transformationen
dc.subjectPartial morphismsen
dc.subjectCategory theoryen
dc.titleCompositional reification of petri netspt_BR
dc.typeRelatório técnico e de pesquisapt_BR
dc.identifier.nrb000264958pt_BR


Files in this item

Thumbnail
   

This item is licensed under a Creative Commons License

Show simple item record