Kreowski H.J., Kuske S.: On the Interleaving Semantics of Transformation Units - A Step into GRACE, in: Abstracts Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, 400-405  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and complex models containing hundreds of rules, model transformation rules must be extended by a sophisticated structuring mechanisms that allow to compose them in a modular way. In the graph transformation community, the concepts of transformation units were introduced for such purpose (e.g. [1, 13]) Definition 1.3.14 A transformation unit ) G 8 UV ( D ; is a system where are graph class expressions (describing initial and terminal graphs) U is a finite set of rules and is a control condition, and is the set of imported transformation units (which is empty, ....

H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units --- a step into GRACE. In J. E. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Graph Grammars and Their Application to Computer Science, volume 1073 of LNCS, pages 89-- 108. Springer, 1996.

....all the necessary instructions on how to implement each rule at the export interface with rules in the body while, in the PROGRES approach, the implementation tasks is completely carried out by the body module. 6. 2 Graph Transformation Units: the GRACE approach The GRACE approach (described in [9]) uses the transformation unit concept as structuring means. It is defined independently form a particular graph transformation approach: a transformation unit is specified by two graph class expressions that describe the allowed classes of initial and terminal graphs, a finite set of local rules, ....

H-J. Kreowski, S. Kuske "On the Interleaving Semantics of Transformation Units -- A Step into GRACE" LNCS n.1073 pp. 89--106 (1996)

....of the transformation unit it is applied to. Both operations underline the flexibility transformation units offer concerning the style of programming. Especially, they induce some necessary conditions under which the import of transformation units does not increase the expressive power. In [KK95] Kreowski and Kuske introduce the notion of a transformation unit together with its interleaving semantics and 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 ....

....for orthogonal rewrite systems. 30 The theory of term graph rewriting has been extended in the last years to the case of graphs with cycles, which can represent infinite, rational terms, and it has been shown that rewriting of these term graphs corresponds to infinite term rewriting sequences [KKSdV90]. In [CD96] Corradini and Drewes take a different point of view, showing that if the rewriting of term graphs is performed using the double pushout approach, then a single graph rewriting can correspond to an infinite parallel rewriting, i.e. to the application of a rewrite rule to infinitely ....

H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units --- A step into GRACE. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear.

....for orthogonal rewrite systems. The theory of term graph rewriting has been extended in the last years to the case of graphs with cycles, which can represent infinite, rational terms, and it has been shown that rewriting of these term graphs corresponds to infinite term rewriting sequences [KKSdV90]. In [CD96] Corradini and Drewes take a different point of view, showing that if the rewriting of term graphs is performed using the double pushout approach, then a single graph rewriting can correspond to an infinite parallel rewriting, i.e. to the application of a rewrite rule to infinitely ....

....of the transformation unit it is applied to. Both operations underline the flexibility transformation units offer concerning the style of programming. Especially, they induce some necessary conditions under which the import of transformation units does not increase the expressive power. In [KK95] Kreowski and Kuske introduce the notion of a transformation unit together with its interleaving semantics and 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 ....

H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units --- A step into GRACE. In Proc. International Workshop on Graph Grammars and Their Application to Computer Science '94, Lecture Notes in Computer Science. Springer-Verlag. To appear.

....systems in the large . Only recently first attempts and results have been presented in order to provide graph transformation systems with guidelines, methodologies, formal techniques, and tools which are needed for developing and maintaining large software systems (see (Janssens, 1996; Kreowski and Kuske, 1996; Ehrig and Engels, 1996; Taentzer and Schurr, 1995; Parisi Presicce, 1996) In 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 ....

Kreowski, H.-J. and Kuske, S. (1996). On the interleaving semantics of transformation units - a step into GRACE. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, LNCS . Accepted.

....rewrite rules, and rule regulation mechanisms. Related publications are first attempts to introduce import export as well as inheritance refinement relationships into the world of graph grammars [10, 17] to encapsulate graph transformation algorithms by means of so called transformation units [20, 33], to adapt the concept of database views to graph data types [26] and to develop new concepts for the design of hierarchical graph structures [12] or distributed systems of graph objects [36] Taking all these sources of inspiration and the state of the art into account, we are currently ....

.... empty bodies are a means to decompose complex graph (database) schemata in the same way as it is done in database systems like PCTE [13] ffl Modules which export a single transformation (with optional pre and postconditions) allow the definition of graph transformation units as suggested in [20]. ffl Modules which summarize and propagate the exported resources of a number of imported modules to their own interfaces, offer more or less the concept of horizontally structuring graph data types as presented in [17] ffl Modules which export a single main node type and a number of related ....

H.-J. Kreowski and S. Kuske. On the Interleaving Semantics of Transformation Units --- A Step into GRACE. In Cuny et al. [8], pages 89--106.

....no means to refine relationships (edge types) or even graph types. It is a common goal of the graph grammar community to introduce modular programming and refinement into the world of graph grammar specifications. Therefore, a variety of publications have been presented concerning this issue (cf. [6, 16, 5, 9, 8]) But for most of these ideas it does not seem possible to apply them in a concrete programming language. To a large degree the problems found in the area of object oriented modeling are quite similar to the ones experienced with graph transformation systems. The advantage of the suggestions and ....

....different approaches. We admit that we have not suggested a concept for the refinement of complex transformations in this abstract, though: ffl Packages which export a single transformation (with optional pre and postconditions) allow the definition of graph transformation units as suggested in [9]. ffl Compared to [8] packages which summarize and propagate the exported resources of a number of imported modules to their own interfaces, offer more or less the concept of horizontally structuring graph data types. Together with the refinement relation, we are also able to provide a notion of ....

H.-J. Kreowski and S. Kuske. On the Interleaving Semantics of Transformation Units --- A Step into GRACE. In Cuny et al. [3], pages 89--106.

....specifying graphical user interfaces of specific interactive systems with special consideration of the consistency conditions between the various graphic presentations of the underlying data of these systems. Ideas to decompose graph grammars in several smaller components can be found in [2] and [9]. In [2] a conceptual framework for a module concept for graph transformations is discussed and in [9] a structuring method for building up large systems of graph rewrite rules from small pieces is proposed for enhancing the usefulness of graph rewriting. As opposed to these two theoretical ....

....consistency conditions between the various graphic presentations of the underlying data of these systems. Ideas to decompose graph grammars in several smaller components can be found in [2] and [9] In [2] a conceptual framework for a module concept for graph transformations is discussed and in [9] a structuring method for building up large systems of graph rewrite rules from small pieces is proposed for enhancing the usefulness of graph rewriting. As opposed to these two theoretical approaches we propose a modularization technique for graph grammars by classifying certain graph rewrite ....

H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units- A step into GRACE. Research Report, University of Bremen, Dept. of Computer Science and Mathematics, 1995.

....complex structured and concurrently (inter )acting graph objects. A very abstract framework is given in [1] where several concepts for modules needed are mentioned, but without introducing a concrete graph data model and a specific graph rewriting approach. The concept of transformation units of [3] has its main focus on grouping sets of related rewrite rules and 1 This work has been partly supported by the ESPRIT Working Group 7138 Computing by Graph Transformation (COMPUGRAPH II) c fl 1995 Elsevier Science B. V. Taentzer modeling use relations between these sets; it neglects aspects ....

H.-J. Kreowski and S. Kuske. On the Interleaving Semantics of Transformation Units - A Step into GRACE. Submitted to proceedings of Graph Grammar Workshop in Williamsburg, 1994.

....either on a very abstract level or offer only partial solutions. Ehrig and Engels introduce in [4] an abstract framework for a module concept, which adapts the world of algebraic specification language module concepts to the world of graphs and graph transformations. Kreowski and Kuske present in [11] so called graph transformation units, which are essentially groups of related rewrite rules together with certain graph class descriptions and rule controlling application conditions. Both papers address thereby topic (2) of our problem list above. Next, two level graph grammars of G ttler [7] ....

....existing integrity constraints of hierarchical graphs as well as all application specific schema consistency constraints. It is future work to develop such a new kind of graph rewrite rules, define their intended semantics as binary relations over hierarchical graphs (as suggested in [4] and [11]) and to extend the principle of refinement subtyping to graph rewrite rules. This means that we have to develop a new concept of graph object types which are complex node types together with a set of consistency preserving rewrite rules. Refinement in this extended setting means then that a more ....

Kreowski H.J., Kuske S.: On the Interleaving Semantics of Transformation Units - A Step into GRACE, in: Abstract Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, 400-405

....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. On the interleaving semantics of transformation units | a step into GRACE. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, volume 1073 of Lecture Notes in Computer Science, pages 89-108, 1996.

No context found.

Kreowski H.J., Kuske S.: On the Interleaving Semantics of Transformation Units - A Step into GRACE, in: Abstracts Proc. 5th Int. Workshop on Graph Grammars and their Application to Computer Science, 400-405

No context found.

H.-J. Kreowski and S. Kuske. On the interleaving semantics of transformation units - a step into GRACE. In 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, LNCS 1073, pages 89 -- 106. Springer Verlag, 1996.

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