H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In Ehrig et al. [5], chapter 15, pages 607-638.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are considered that shed some light on how the di erent components of transformation units are related to each other. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts. In [KK99] and [DKKK00] transformation modules are considered that encapsulate sets of transformation units. A transformation module has an export interface, an import interface, and a formal parameter. With the rst two, sets of transformation units can be exported and imported while the latter allows to ....

....transformation units which are de ned or imported by the surrounding module. Moreover, they allow pre and post conditions to be speci ed. Semantically, each module speci es a binary relation on graphs for each exported item. The transformation units of modules are a simpli ed version of those in [KK99] because they are relieved from their interfaces and local rules. One of the basic components of a transformation unit is its control condition which allows to restrict the non determinism of graph transformation. 9 The concept of transformation units is abstract in the sense that each ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages and Tools, chapter 15, pages 607-638. World Scientic, 1999.

....of a unit can be modi ed and adapted before it is used by another unit. In this way, one can specify modular systems with heterogeneous components. The introduced concepts of transformation units and transformation modules generalize our respective notions for graph transformation approaches (see [KK96, KKS97, KK99b, KK99a, DKKK00, HHKK00]) 2 Transformation units In this section, we recall the notion of a transformation unit as a means to decompose a system with a large set of rules into a family of subcomponents which use each other. The notion is independent of a particular rule based framework. This is achieved by assuming an ....

....(see e.g. Roz97, EEKR99, EKMR99] because there are many types of graphs and many ways to apply rules to them. As we have introduced originally the concepts of transformation units for arbitrary graph transformation approaches, which are special cases of rule bases, our considerations in [KK96, KKS97, KK99a] provide many examples in the more general setting of this paper, too, including, for instance, a structured speci cation of the Floyd Warshall algorithm for shortest paths and a graph colouring algorithm in the style of constraint programming. 3 Transformation modules The basic idea of ....

[Article contains additional citation context not shown here]

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99], pages 607-638.

....semantics is a xed point. A network becomes a transformation module if it is provided with an import interface and an export interface. The introduced concepts of transformation units and transformation modules generalize our respective notions for graph transformation approaches (see [KK96, KKS97, HHKK99, KK99, DKKK99]) 2 Transformation units In this section, we introduce the notion of a transformation unit as a means to decompose a system with a large set of rules into a family of subcomponents which use each other. The notion is independent of a particular rule based framework. This is achieved by assuming ....

....(see e.g. Roz97, EEKR99, EKMR99] because there are many types of graphs and many ways to apply rules to them. As we have introduced originally the concepts of transformation units for arbitrary graph transformation approaches, which are special cases of rule bases, our considerations in [KK96, KKS97, KK99] provide many examples in the more general Note on approach independent structuring concepts for rule based systems setting of this paper, including, for instance, a structured speci cation of the Floyd Warshall algorithm for shortest paths and a graph colouring algorithm in the style of ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99].

....operation for SFC: A sub chart is inserted between a transition and a step which is represented by a transformation on the SRHG. In DiaGen , syntax directed editing operations are speci ed in terms of simple rules and complex operations quite similar to rules and transformation units in GRACE [6]. Rules are speci ed as pairs of LHS and RHS with optional application conditions which may consist of negative context or path expressions which have to be satis ed when a rule is going to be applied. Operations are de ned in terms of rules 2 ; control conditions describe valid sequences of ....

H.-J. Kreowski and S. Kuske. Graph Transformation Units and Modules. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, vol. II: Applications, Languages and Tools, pp. 607-638. World Scientic, 1999.

....semantics is a xed point. A network becomes a transformation module if it is provided with an import interface and an export interface. The introduced concepts of transformation units and transformation modules generalize our respective notions for graph transformation approaches (see [KK96, KKS97, HHKK99, KK99, DKKK99]) 2 Transformation units In this section, we introduce the notion of a transformation unit as a means to decompose a system with a large set of rules into a family of subcomponents which use each other. The notion is independent of a particular rule based framework. This is achieved by assuming ....

....(see e.g. Roz97, EEKR99, EKMR99] because there are many types of graphs and many ways to apply rules to them. As we have introduced originally the concepts of transformation units for arbitrary graph transformation approaches, which are special cases of rule bases, our considerations in [KK96, KKS97, KK99] provide many examples in the more general setting of this paper, too, including, for instance, a structured speci cation of the Floyd Warshall algorithm for shortest paths and a graph colouring algorithm in the style of constraint programming. 3 Transformation modules The basic idea of ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99]. To appear.

No context found.

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99], chapter 15, pages 607-638.

....system that structuring concepts for dividing them into small units of sets of rules become necessary. In the last years, a series of such structuring concepts for graph transformation systems has been developed [13] In this paper we concentrate on the structuring concept of transformation units [18, 17, 21]. A transformation unit consists of a set of graph transformation rules, a set of imported transformation units, a control condition, an initial graph class expression, and a terminal graph class expression. Semantically, it transforms initial graphs into terminal graphs by interleaving rule ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [7], pages 607-638.

....semantics is a xed point. A network becomes a transformation module if it is provided with an import interface and an export interface. The introduced concepts of transformation units and transformation modules generalize our respective notions for graph transformation approaches (see [KK96, KKS97, KK99a, KK99b, DKKK00, HHKK00]) The running example, illustrating the new structuring concepts, is taken from the area of algebraic speci cation and term rewriting and speci es a balancedness test for binary trees as a transformation module. 2 Transformation units In this section, we introduce the notion of a ....

....(see e.g. Roz97, EEKR99, EKMR99] because there are many types of graphs and many ways to apply rules to them. As we have introduced originally the concepts of transformation units for arbitrary graph transformation approaches, which are special cases of rule bases, our considerations in [KK96, KKS97, KK99a] provide many examples in the more general setting of this paper, too, including, for instance, a structured speci cation of the Floyd Warshall algorithm for shortest paths and a graph colouring algorithm in the style of constraint programming. 3 Transformation modules The basic idea of ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99], pages 607-638.

....studies indicate the need for suitable structuring principles which are independent of a particular graph transformation approach. To this end, the concept of transformation units is presented, which allows systematic and structured specification and programming based on graph transformation. In [KK99] the notions of transformation unit and transformation module are introduced as means for 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, a control ....

....units which are defined or imported by the surrounding module. Moreover, they allow pre and post conditions to be specified. Semantically, each module specifies a binary relation on graphs for each exported item. The transformation units of modules are a simplified version of those in [KK99] because they are relieved from their interfaces and local rules. 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 abstract in the sense that each formalism ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Hartmut Ehrig, Gregor Engels, Hans-Jorg Kreowski, and Grzegorz Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, chapter 15, pages 607--638. World Scientific, 1999. To appear.

.... for graph transformation systems are currently under development (cf. also [HEET99] One of them is the transformation unit, a structuring principle which allows to decompose large graph transformation systems into small reusable units that can import each other (see [KK96, KKS97, AEH 99, KK99] It transforms graphs by interleaving rule applications with calls of imported transformation units. One fundamental feature of the transformation unit is its independence of a particular graph transformation approach, i.e. of a selected graph data model, a specific type of rules, etc. see ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99]. To appear.

....supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and the ESPRIT Working Group APPLIGRAPH through the University of Bremen. 1 a transformation unit is a proven concept for the specification of a single operation on graphs (see [KK96,KKS97,AEH 99,KK99] a transformation module encapsulates 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 ....

....of a particular choice of graphs, rules, and direct derivations. Actually, our module concept follows the lines of research that led to the notion of transformation units and simple modules as structuring concepts of the graph and rule centered language GRACE (see [KK96,AEH 99,KKS97,HHKK98,KK99] 2 Transformation Units In this section, we recall the concept of transformation units and their interleaving semantics. Transformation units will be used as constituent components of transformation modules in Section 4. A transformation unit comprises a set of reuls, descriptions of initial ....

Hans-Jorg Kreowski and Sabine Kuske. Graph transformation units and modules. In Ehrig et al. [EEKR99]. To appear.

No context found.

H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In Ehrig et al. [5], chapter 15, pages 607-638.

No context found.

H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, chapter 15, pages 607--638. 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC