Results 1  10
of
25
Graph Transformations on DomainSpecific Models
"... In model driven development, model transformations play a crucial role. This paper introduces a new, UMLbased approach for the specification and implementation of model transformations. The technique is based on graph transformations, where the transformations are a set of explicitly sequenced el ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
In model driven development, model transformations play a crucial role. This paper introduces a new, UMLbased approach for the specification and implementation of model transformations. The technique is based on graph transformations, where the transformations are a set of explicitly sequenced elementary rewriting operations. UML class diagrams are used to represent the graph grammars for the input and output graphs. The paper’s main contributions are the visual language designed for the representation of transformation programs and the graph transformation execution engine which implements the semantics of the language.
Distributed Graph Transformation Units
 International Journal on Software Engineering and Knowledge Engineering
, 2002
"... Transformation units are a structuring principle for graph transformation systems. In this paper we introduce distributed transformation units that can be used to model distributed graph transformation systems. A distributed transformation unit consists of a set of local transformation units which a ..."
Abstract

Cited by 31 (23 self)
 Add to MetaCart
Transformation units are a structuring principle for graph transformation systems. In this paper we introduce distributed transformation units that can be used to model distributed graph transformation systems. A distributed transformation unit consists of a set of local transformation units which are connected via interface units. Semantically, a distributed transformation unit transforms distributed graphs consisting of a set of local graphs connected via interface graphs, in such a way that every local graph with its interfaces is transformed by a local transformation unit. Since the interface graphs can be modified concurrently by various local transformation units we introduce a concurrent semantics of transformation units. The presented concepts are illustrated with a running example of a simple game where two different actors access a common game board randomly.
More About Control Conditions for Transformation Units
 Proc. Theory and Application of Graph Transformations, volume 1764 of Lecture Notes in Computer Science
, 1998
"... A transformation unit is a structuring principle for composing graph transformation systems from small units. One of the basic components of a transformation unit is its control condition which allows to restrict the nondeterminism of graph transformation. The concept of transformation units is gen ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
A transformation unit is a structuring principle for composing graph transformation systems from small units. One of the basic components of a transformation unit is its control condition which allows to restrict the nondeterminism of graph transformation. The concept of transformation units is generic in the sense that each formalism which specifies a binary relation on graphs can be used as a control condition. This paper discusses a selection of concrete classes of control conditions which seem to provide reasonable expressive power for specifying and programming with transformation units. These include regular expressions, once, aslongaspossible, priorities, and conditionals; some of them were already used in an ad hoc manner in earlier papers. It is shown which classes of control conditions can be replaced by others without changing the semantics of the corresponding transformation unit. Moreover, three properties of control conditions are studied: minimality, i...
Generating Diagram Editors Providing FreeHand Editing as well as SyntaxDirected Editing
 In Proc. International Workshop on Graph Transformation (GraTra 2000
, 2000
"... Diagram editors which are tailored to a specific diagram language typically support either syntaxdirected editing or freehand editing, i.e., the user is either restricted to a collection of predefined editing operations, or he is not restricted at all, but misses the convenience of such complex ed ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
Diagram editors which are tailored to a specific diagram language typically support either syntaxdirected editing or freehand editing, i.e., the user is either restricted to a collection of predefined editing operations, or he is not restricted at all, but misses the convenience of such complex editing operations. This paper proposes a concept for incorporating both modes into one editor in order to get the combined advantages. This proposal extends work on freehand editors which are generated from a formal hypergraph grammar specification by the diagram editor generator DiaGen .
Abstract Hierarchical Graph Transformation
 MATH. STRUCT. IN COMP. SCIENCE
, 2005
"... In this paper, we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and edges likewise) into a hierarchy of packages. In contrast to other known approaches, we do not fix the type of underlying graphs. Moreover, our model is equipped ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
In this paper, we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and edges likewise) into a hierarchy of packages. In contrast to other known approaches, we do not fix the type of underlying graphs. Moreover, our model is equipped with a rulebased transformation concept such that hierarchical graphs cannot only be used for static representation of complex system states, but also for the description of the dynamic system behaviour.
Graph Transformation Modules and their Composition
 Proc. AGTIVE
, 1999
"... In this paper, we investigate the notion of transformation modules as a structuring principle for the specification of graph transformation systems which provide a collection of operations on graphs. Based on the notion of transformation units, a concept that allows to specify binary relations on gr ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
In this paper, we investigate the notion of transformation modules as a structuring principle for the specification of graph transformation systems which provide a collection of operations on graphs. Based on the notion of transformation units, a concept that allows to specify binary relations on graphs, a transformation module consists of a set of transformation units. To be able to distinguish between hidden and public operations, a module has an export interface. Moreover, there may be an import interface and a formal parameter. The import interface allows the use of transformation units which are known in the environment of a module. The formal parameter consists of formal parameter units which specify operations on graphs in a loose way. A formal parameter unit may be instantiated by an exported transformation unit of another module through module composition.
Autonomous units and their semantics  the parallel case
 RECENT TRENDS IN ALGEBRAIC DEVELOPMENT TECHNIQUES, 18TH INTERNATIONAL WORKSHOP, WADT 2006. VOLUME 4408 OF LECTURE
, 2006
"... Communities of autonomous units are rulebased and graphtransformational devices to model dataprocessing systems that may consist of distributed and mobile components. The components may communicate and interact with each other, they may link up to adhoc networks. In this paper, we introduce and ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
Communities of autonomous units are rulebased and graphtransformational devices to model dataprocessing systems that may consist of distributed and mobile components. The components may communicate and interact with each other, they may link up to adhoc networks. In this paper, we introduce and investigate the parallelprocess semantics of communities of autonomous units.
ApproachIndependent Structuring Concepts for RuleBased Systems
 Proc. 16th Int. Workshop on Algebraic Development Techniques (WADT 2002). Volume 2755 of Lecture Notes in Computer Science
, 2002
"... In this paper, we propose new structuring concepts for rulebased systems that are independent of the type of rules and of the type of configurations to which rules are applied. Hence the concepts are applicable in various rulebased approaches allowing one to build up large systems from small compo ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
In this paper, we propose new structuring concepts for rulebased systems that are independent of the type of rules and of the type of configurations to which rules are applied. Hence the concepts are applicable in various rulebased approaches allowing one to build up large systems from small components in a systematic way.
Graph Transformation Units – An Overview
 Concurrency, Graphs and Models. Lecture Notes in Computer Science 5065
, 2008
"... Abstract. In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of graph processing and graph transformation. ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. In this paper, we give an overview of the framework of graph transformation units which provides syntactic and semantic means for analyzing, modeling, and structuring all kinds of graph processing and graph transformation.
UML Interaction Diagrams: Correct Translation of Sequence Diagrams into Collaboration Diagrams
, 2003
"... Abstract. In this paper, the two types of UML interaction diagrams are considered. A translation of sequence diagrams into collaboration diagrams is constructed by means of graph transformation and shown correct. 1 ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, the two types of UML interaction diagrams are considered. A translation of sequence diagrams into collaboration diagrams is constructed by means of graph transformation and shown correct. 1