Results 1  10
of
11
Shapely Hierarchical Graph Transformation
 Journal of Computer and System Sciences
, 2001
"... Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: ..."
Abstract

Cited by 66 (14 self)
 Add to MetaCart
Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs:
An Algebra of Hierarchical Graphs and its Application to Structural Encoding
, 2010
"... We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a highlevel language for describing graphs with a nodesharing, embedding structure, and it is then w ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a highlevel language for describing graphs with a nodesharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects. In particular, we propose the use of our graph formalism as a convenient way to describe configurations in process calculi equipped with inherently hierarchical features such as sessions, locations, transactions, membranes or ambients. The graph syntax can be seen as an intermediate representation language, that facilitates the encodings of algebraic specifications, since it provides primitives for nesting, name restriction and parallel composition. In addition, proving soundness and correctness of an encoding (i.e. proving that structurally equivalent processes are mapped to isomorphic graphs) becomes easier as it can be done by induction over the graph syntax.
An Enhanced GraphOriented Approach for Change Management in Distributed Biomedical Ontologies and Linked Data
"... Abstract — This paper reports the summary and results of our research on providing a graph oriented formalism to represent, analyze and validate the evolution of bioontologies, with emphasis on the FungalWeb Ontology. In this approach Category theory along with rulebased hierarchical distributed ( ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract — This paper reports the summary and results of our research on providing a graph oriented formalism to represent, analyze and validate the evolution of bioontologies, with emphasis on the FungalWeb Ontology. In this approach Category theory along with rulebased hierarchical distributed (HD) graph transformation have been employed to propose a more specific semantics for analyzing ontological changes and transformations between different versions of an ontology, as well as tracking the effects of a change in different levels of abstractions. Keywordscomponent; bioontologies, ontology evolution,
Ensuring Containment Constraints in Graphbased Model Transformation Approaches
, 2007
"... Within model driven software development, model transformation has become a key activity. A number of transformation approaches for metamodeldefined modeling languages have been developed in the past years and are going to be established in research and industry. None of these have made it to a sta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Within model driven software development, model transformation has become a key activity. A number of transformation approaches for metamodeldefined modeling languages have been developed in the past years and are going to be established in research and industry. None of these have made it to a standard yet. There is a demand for correct model transformation in various senses. Formal methods are helpful for showing correctness issues of model transformations. As one approach, graph transformation has been applied to the field of model transformation and is a perspective for achieving provable correct model transformations. We show in this paper, that containment associations as proposed by the OMG are an integral part of MOFbased languages and imply a couple of constraints which must be ensured in model transformation approaches. Based on a doublepushout approach to graph transformation, conditions are stated that ensure these containment constraints. This is an important step for achieving formal transformation semantics for modeling languages based on MOF, or specifically EMF.
An Algebra of Hierarchical Graphs
, 2010
"... We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a highlevel language for describing graphs with a nodesharing, embedding structure, and it is then ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can be understood as a highlevel language for describing graphs with a nodesharing, embedding structure, and it is then well suited for defining graphical representations of software models where nesting and linking are key aspects.
Modeling a Service and Session Calculus with Hierarchical Graph Transformation
, 2010
"... Graph transformation techniques have been applied successfully to the modelling of process calculi, for example for equipping them with a truly concurrent semantics. Recently, there has been an increasing interest towards hierarchical structures both at the level of graphbased models, in order to r ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Graph transformation techniques have been applied successfully to the modelling of process calculi, for example for equipping them with a truly concurrent semantics. Recently, there has been an increasing interest towards hierarchical structures both at the level of graphbased models, in order to represent explicitly the interplay between linking and containment (like in Milner’s bigraphs), and at the level of process calculi, in order to deal with several logical notions of scoping (ambients, sessions and transactions, among others). In this paper we show how to encode a sophisticated calculus of services and nested sessions by exploiting a suitable flavour of hierarchical graphs. For the encoding of the processes of this calculus we benefit from a recently proposed algebra of graphs with nesting.
ISSN 02496399 ISRN INRIA/RR6225FR+ENGFormalizing Visibility Characteristics in Hierarchical Systems
"... apport de recherche ..."
(Show Context)
Software & Systems Modeling manuscript No. (will be inserted by the editor)
"... Towards an integrated graphbased semantics for UML ..."
(Show Context)
ECEASST Ensuring Containment Constraints in Graphbased Model Transformation Approaches
"... Within model driven software development, model transformation has become a key activity. A number of transformation approaches for metamodeldefined modeling languages have been developed in the past years and are going to be established in research and industry. None of these have made it to a sta ..."
Abstract
 Add to MetaCart
(Show Context)
Within model driven software development, model transformation has become a key activity. A number of transformation approaches for metamodeldefined modeling languages have been developed in the past years and are going to be established in research and industry. None of these have made it to a standard yet. There is a demand for correct model transformation in various senses. Formal methods are helpful for showing correctness issues of model transformations. As one approach, graph transformation has been applied to the field of model transformation and is a perspective for achieving provable correct model transformations. We show in this paper, that containment associations as proposed by the OMG are an integral part of MOFbased languages and imply a couple of constraints which must be ensured in model transformation approaches. Based on a doublepushout approach to graph transformation, conditions are stated that ensure these containment constraints. This is an important step for achieving formal transformation semantics for modeling languages based on MOF, or specifically EMF.
ECEASST Stochastic Graph Transformation with Regions
"... Abstract: Graph transformation can be used to implement stochastic simulation of dynamic systems based on semiMarkov processes, extending the standard approach based on Markov chains. The result is a discrete event system, where states are graphs, and events are rule matches associated to general d ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: Graph transformation can be used to implement stochastic simulation of dynamic systems based on semiMarkov processes, extending the standard approach based on Markov chains. The result is a discrete event system, where states are graphs, and events are rule matches associated to general distributions, rather than just exponential ones. We present an extension of this model, by introducing a hierarchical notion of event location, allowing for stochastic dependence of higherlevel events on lowerlevel ones.