Results 1  10
of
16
A Formal Semantics of UML State Machines Based on Structured Graph Transformation
 UML 2001: The Unified Modeling Language. Modeling Languages, Concepts and Tools, volume 2185 of LNCS
, 2001
"... UML state machines are quite popular and useful to specify dynamic components of software systems. They have a formal static semantics but their execution semantics is described only informally. Graph transformation, on the other hand, constitutes a wellstudied area with many theoretical results an ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
(Show Context)
UML state machines are quite popular and useful to specify dynamic components of software systems. They have a formal static semantics but their execution semantics is described only informally. Graph transformation, on the other hand, constitutes a wellstudied area with many theoretical results and practical application domains. In this paper, an operational semantics for a subset of UML state machines is proposed which is based on graph transformation. In more detail, a UML state machine is described as a structured graph transformation system in such a way that the wellformedness rules of UML state machines are satisfied and the ring of a (maximum) set of enabled nonconicting transitions corresponds to the application of a graph transformation rule. The presented approach uses the concept of transformation units, a recently developed modularization concept for graph transformation systems.
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.
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
(Show Context)
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.
Simple Modules for GRACE
, 1998
"... The language Grace is being proposed for specifying and programming in a graphcentered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structuring of programs. In this paper we present a simple kind of modules for the language which encapsulate rules an ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
The language Grace is being proposed for specifying and programming in a graphcentered environment based on graph transformation. Emphasis in the design of Grace is laid on modular structuring of programs. In this paper we present a simple kind of modules for the language which encapsulate rules and graph transformation units, and export some of them. The local transformation units define compound graph transformations that call rules and other transformation units which are either defined by the surrounding module, or imported from other modules. The interleaving semantics of modules specifies a binary relation on graphs for each exported item.
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
(Show Context)
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.
Mathematical Model Transformations
, 2001
"... Classes: these Classes may not have any instances (at a lower metalevel). ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Classes: these Classes may not have any instances (at a lower metalevel).
Some essentials of graph transformation
 RECENT ADVANCES IN FORMAL LANGUAGES AND APPLICATIONS. STUDIES IN COMPUTATIONAL INTELLIGENCE
, 2006
"... This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
This chapter introduces rulebased graph transformation, which constitutes a wellstudied research area in computer science. The chapter presents the most fundamental definitions and illustrates them with some selected examples. It presents also the concept of transformation units, which makes pure graph transformation more feasible for specification and modeling aspects. Moreover, a translation of Chomsky grammars into graph grammars is given and the main theorems concerning parallelism and concurrency are presented. Finally, an introduction to hyperedge replacement is given, a concept which has nice properties because it transforms hypergraphs in a contextfree way.
Rulebased transformation of graphs and the product type
 Handbook on Transformation of Knowledge, Information, and Data. Toappear
"... This chapter presents rulebased graph transformation as a framework for modeling dataprocessing systems. It recalls the structuring concept of graph transformation units which allows for transforming graphs in a rulebased, modularized, and controlled way. In order to get a flexible typing mechanis ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
This chapter presents rulebased graph transformation as a framework for modeling dataprocessing systems. It recalls the structuring concept of graph transformation units which allows for transforming graphs in a rulebased, modularized, and controlled way. In order to get a flexible typing mechanism and a high degree of parallelism, this structuring concept is extended to the product of transformation units. Moreover, it is demonstrated how the product type can be used to transform graph transformation units. The authors advocate rulebased graph transformation for all applications where data, knowledge, and information can be modeled as graphs and their transformation can be specified by means of rules in an adequate way. 1
Undecidable Control Conditions in Graph Transformation Units
"... Graph transformation units are an approachindependent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in a terminal graph. This transformation process has to obey a socalled control condition, i.e. the device to select how ru ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Graph transformation units are an approachindependent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in a terminal graph. This transformation process has to obey a socalled control condition, i.e. the device to select how rules or imported transformation units are to be combined in the transformation process executed by the unit. While the other parts of a unit may simply be required to be computable, this is too restrictive for control conditions. In this paper, we show that the semantics of certain control conditions is in general undecidable already when a single imported transformation unit occurs in the condition, and discuss the consequences for programming with graph transformation units.
Appligraph: Applications of Graph Transformation  Fourth Annual Progress Report
, 2001
"... This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and devel ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This report summarizes the activities in the fourth year of the ESPRIT Working Group APPLIGRAPH, covering the period from April 1, 2000, to March 31, 2001. The principal objective of this Working Group is to promote applied graph transformation as a rulebased framework for the specication and development of systems, languages, and tools and to improve the awareness of its industrial relevance