Results 1  10
of
25
Graph Transformation Units with Interleaving Semantics
 Formal Aspects of Computing
, 1999
"... The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descript ..."
Abstract

Cited by 39 (25 self)
 Add to MetaCart
(Show Context)
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descriptions of initial and terminal graphs, and a control condition. Moreover, it may import other transformation units for structuring purposes. Its semantics is a binary relation between initial and terminal graphs which is given by interleaving sequences. As a generalization of ordinary derivations, an interleaving sequence consists of direct derivation steps interleaved with calls of imported transformation units. It must obey the control condition and may be seen as a kind of structured derivation. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts.
Horizontal and Vertical Structuring of Typed Graph Transformation Systems
, 1996
"... this paper we concentrate on structuring and refinement concepts for graph transformation systems. Conceptually, we distinguish between two kinds of structuring. We speak of horizontal structuring if a large specification is obtained by combining and modifying smaller ones, possibly sharing some com ..."
Abstract

Cited by 32 (19 self)
 Add to MetaCart
this paper we concentrate on structuring and refinement concepts for graph transformation systems. Conceptually, we distinguish between two kinds of structuring. We speak of horizontal structuring if a large specification is obtained by combining and modifying smaller ones, possibly sharing some common parts. Instead, if we consider the relationship between a more abstract and a more concrete version of the same specification, or between a specification and its implementation, we speak of vertical structuring.
Graph Transformation Units And Modules
, 1999
"... The significance of graphs and rules in many areas of computer science is evident: On the one hand, graphs constitute appropriate means for the description of complex relationships between objects. Trees, Petri nets, circuit diagrams, data flow graphs, state charts, and entityrelationship diagrams ..."
Abstract

Cited by 25 (16 self)
 Add to MetaCart
The significance of graphs and rules in many areas of computer science is evident: On the one hand, graphs constitute appropriate means for the description of complex relationships between objects. Trees, Petri nets, circuit diagrams, data flow graphs, state charts, and entityrelationship diagrams are some typical examples. On the other hand, rules are used to describe "permitted" actions on objects as, for example, in the areas of functional and logic programming, formal languages, algebraic specification, theorem proving, and rulebased systems. The intention of bringing graphs and rules together  motivated by several application areas  has led to the theory of graph grammars and graph transformation (see volume I of the Handbook and [17] for a survey). A wide spectrum of approaches exists within this theory and some of them are implemented (see, for example, Progres [8, 9], Graph Ed [10], Dactl [11], and Agg...
Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
 ELECTRONIC NOTES IN THEOR. COMPUT. SCI
, 1995
"... Currently existing graph grammarbased specification languages have serious problems with supporting any kind of "specificationinthelarge" activities. More precisely, they have deficiences with respect to modeling hierarchical data structures or specifying meta activities like manipulat ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
Currently existing graph grammarbased specification languages have serious problems with supporting any kind of "specificationinthelarge" activities. More precisely, they have deficiences with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an infinite number of schema, metaschema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar specification language where in addition information hiding aspects like explicit export and import interfaces are expressible.
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
(Show Context)
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...
UML packages for programmed graph rewriting systems
 In Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT'98
, 1998
"... Abstract: Specification and rapid prototyping of graph manipulation software by means of PROgrammed Graph REwriting Systems (PROGRES) is a paradigm, which attracts more and more interest in various fields of computer science. Nowadays produced specifications for process modeling tools, database quer ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
Abstract: Specification and rapid prototyping of graph manipulation software by means of PROgrammed Graph REwriting Systems (PROGRES) is a paradigm, which attracts more and more interest in various fields of computer science. Nowadays produced specifications for process modeling tools, database query languages, etc. have a typical size of about 100 to 300 printed pages. They suffer severely from the lack of any module concept. This paper introduces a module concept for the graph rewriting (transformation) language PROGRES, which is closely related to the package concept of the standardized OO modeling language UML. It supports a variety of software
Classification and comparison of module concepts for graph transformation systems
 In Ehrig et
, 1999
"... In this chapter we use a threelevel approach for analyzing module concepts for graph transformation systems. Based on the observation that module architectures consist of basic specifications like body or export interface and relations like the implementation relation between them, or the import re ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
In this chapter we use a threelevel approach for analyzing module concepts for graph transformation systems. Based on the observation that module architectures consist of basic specifications like body or export interface and relations like the implementation relation between them, or the import relation between a client and a server module, module concepts are characterized by answering the questions 1. What are the basic specifications? 2. Which relations between specifications are used? 3. How are specifications and relations combined to module architectures? These three questions are investigated for five module concepts available in the literature. As a reference example, a sample modular specification of resource management in distributed operating systems is presented.
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.
Towards a Formal Specification Method for Graphical User Interfaces Using Modularized Graph Grammars
 Proceedings of the Eighth International Workshop on Software Specification and Design, IEEE Computer Society, IEEE Computer
, 1996
"... Well designed graphical user interfaces offer a high potential to increase the productivity of human users. The necessary condition for such a good performance is that the user interface represents the semantics of the underlying application in a clear and comprehensible way. This means, especially, ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
(Show Context)
Well designed graphical user interfaces offer a high potential to increase the productivity of human users. The necessary condition for such a good performance is that the user interface represents the semantics of the underlying application in a clear and comprehensible way. This means, especially, that not only syntactical layout but also semantic consistency conditions between the various interaction objects have to be presented in a graphical user interface appropriately. This is usually termed semantic feedback. Many representation schemes have been proposed to express the properties of graphical manmachine interfaces. However, many of them concentrate on control flow design and do not easily scale up to realistic problems. In this contribution we propose a graph and graph grammar based approach which addresses the problem of semantic consistency of dialogs in graphical user interfaces. The main emphasis here lies on an appropriate specification of the consistency conditions betw...
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.