Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-10282
For citation please use:
Main Title: Process Denition of Adhesive HLR Systems (Long Version)
Author(s): Hermann, Frank
Type: Research Paper
Language Code: en
Abstract: Process 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.
URI: https://depositonce.tu-berlin.de/handle/11303/11398
http://dx.doi.org/10.14279/depositonce-10282
Issue Date: 2008
Date Available: 17-Jun-2020
DDC Class: 004 Datenverarbeitung; Informatik
Subject(s): process definition
graph transformation
adhesive HLR systems
License: http://rightsstatements.org/vocab/InC/1.0/
Series: Forschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin
Series Number: 2008-09
ISSN: 1436-9915
Appears in Collections:Fak. 4 Elektrotechnik und Informatik » Publications

Files in This Item:
tr-2008-09.pdf
Format: Adobe PDF | Size: 1.05 MB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.