Reference : Process Definition of Adhesive HLR Systems
Reports : External report
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/5615
Process Definition of Adhesive HLR Systems
English
Hermann, Frank mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
2008
Technische Universität Berlin,Fakultät IV
ISSN 1436-9915
2008/09
Berlin
Germany
[en] 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.
http://hdl.handle.net/10993/5615
http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2008/2008-09.pdf

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
2008-09.pdfPublisher postprint1.05 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.