Process Denition of Adhesive HLR Systems (Long Version)

dc.contributor.authorHermann, Frank
dc.date.accessioned2020-06-17T06:54:56Z
dc.date.available2020-06-17T06:54:56Z
dc.date.issued2008
dc.description.abstractProcess models of graph transformation systems are based on the concept of occurrence grammars, which are a generalization of Petri net processes given by occurrence nets. Recently, subobject transformation systems were proposed as an abstract framework for occurrence grammars in adhesive categories, but they are restricted to monomorphic matches for transformation steps. In this paper we review the construction of STSs as processes for plain graph grammars and present an extension to weak adhesive HLR categories with non-monomorphic matching, such that e.g. attributed graph grammars are included.en
dc.identifier.issn1436-9915
dc.identifier.urihttps://depositonce.tu-berlin.de/handle/11303/11398
dc.identifier.urihttp://dx.doi.org/10.14279/depositonce-10282
dc.language.isoen
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc004 Datenverarbeitung; Informatik
dc.subject.otherprocess definitionen
dc.subject.othergraph transformationen
dc.subject.otheradhesive HLR systemsen
dc.titleProcess Denition of Adhesive HLR Systems (Long Version)en
dc.typeResearch Paper
dc.type.versionsubmittedVersionen
tub.accessrights.dnbfree
tub.affiliationFak. 4 Elektrotechnik und Informatikde
tub.affiliation.facultyFak. 4 Elektrotechnik und Informatikde
tub.publisher.universityorinstitutionTechnische Universität Berlin
tub.series.issuenumber2008-09
tub.series.nameForschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin

Files

Original bundle
Now showing 1 - 1 of 1
Loading…
Thumbnail Image
Name:
tr-2008-09.pdf
Size:
1.02 MB
Format:
Adobe Portable Document Format

Collections