A Framework of hierarchical graphs and its application to the semantics of SRML
View/Open
Cita com:
hdl:2117/91279
Document typeResearch report
Defense date2012
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
Hierarchical grapsh or, in general, hierarchical graph structures are needed when describing visual models at different levels of abstraction. This is the case of the semantic model of SRML, the service modeling language of the european project SENSORIA. In particular, the state model of this language is considered at two level of abstraction. Roughly, at the lowest level, a state configuration is a graph consisting of interconnected components and, at the highest level, business configurations are graphs consisting of interconnected activities, where each activity is a graph of components. Then, a state configuration is the flattening of the corresponding business configuration. Following these ideas, in this paper, we present a new framework of hierarchical graphs, showing that it is m-adhesive. Then we show how this framework can be used to define (part of) a graph transformation semantics of SRML.
CitationMylonakis, N., Orejas, F. "A Framework of hierarchical graphs and its application to the semantics of SRML". 2012.
Is part ofLSI-12-1-R