F. Drewes, P. Knirsch, H.-J. Kreowski, and S. Kuske, Graph transformation modules and their composition, Proc. AGTIVE 1999 (M. Nagl, A. Schurr, and M. Munch, eds.), 2000, pp. 15--30.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 specify ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Proc. Workshop on Applications of Graph Transformations With Industrial Relevance, Lecture Notes in Computer Science, 2000. To appear.

....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 ....

....units with the node set VBODY , and IMPORT and EXPORT are subsets of VBODY . The semantics of a module is given by the semantics of its body restricted to the export where the semantics of the import can be chosen arbitrarily. 3. 3 Examples Some examples of transformation modules can be found in [KK99a, DKKK00, HHKK00] where the units realize algorithms and operations on some types of graphs by using and composing other algorithms and operations. In these cases, all units of a module rely on the same rule base such that the structuring of a large set of rules of a rule based system by means of smaller pieces ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Proc. Applications of Graph Transformations With Industrial Relevance, volume 1779 of Lecture Notes in Computer Science, pages 15-30, 2000.

....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 ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Proc. Workshop on Applications of Graph Transformations With Industrial Relevance, Lecture Notes in Computer Science, 1999. To appear.

....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 ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Proc. Workshop on Applications of Graph Transformations With Industrial Relevance, Lecture Notes in Computer Science, 1999. To appear.

No context found.

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Nagl et al. [NSM00], pages 15-30.

....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 ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In Proc. Applications of Graph Transformations with Industrial Relevance, volume 1779 of Lecture Notes in Computer Science, pages 15-30, 2000.

....10 (i.e. maxwt) and 2, respectively. A violation of feasibility condition (b) can have either of two reasons: no direct connection between the source and destination of the job, or a too narrow time window for the distance to cover. Performing rst a shortest path algorithm on the map (see, e.g. DKKK00] before starting any computation would avoid the rst diculty, and allow to detect the second. However, adding new connections between locations would obscure the actual path along which a job is taken. So, we propose a dual solution, i.e. we allow to split a job from location a to location c by ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In M. Nagl, A. Schurr, and M. Munch, editors, Proc. Applications of Graph Transformations with Industrial Relevance (AGTIVE'99), volume 1779 of Lecture Notes in Computer Science, pages 15-30. Springer, 2000.

....Language Issues, Tool Issues, and Application Domains. 4.1 Language Issues In this area topics in graph transformation based languages are investigated, like typing, modularity, re nement, parallelism, concurrency, distribution, optimisation, and correctness. 4.1. 1 Modularity The papers [DKKK00] and [KK00a] which were already described in the Third Annual Report, have now appeared. 6 Transformation units and transformation modules are known as structuring concepts for graph transformation systems. Their semantics is based on the interleaving of rule applications and calls to imported ....

Frank Drewes, Peter Knirsch, Hans-Jorg Kreowski, and Sabine Kuske. Graph transformation modules and their composition. In M. Nagl and A. Schurr, editors, Proc. Applications of Graph Transformation with Industrial Relevance (AGTIVE'99), volume 1779 of Lecture Notes in Computer Science, pages 15-30, 2000.

....more visible in the applied areas of computer science. The outcome of the GRACE process consists so far of some papers which are more or less in uenced by the discussed ideas and a part of which refers explicitly to GRACE (see, e.g. 10] 17] 11] 21] 16] 1] 8] 12] 13] 2] [4], 9] 14] 15] 18] In this paper, we introduce and survey GRACE as a unifying approach to graph transformation based speci cation with emphasis on uniform modeling of graphical processes. In particular, the following fundamentals are discussed: approach independence, This work was ....

....unit that transforms a hypergraph into a bipartite graph where each hyperedge is represented by a new node and many other transformations between graphs of di erent types. 4 Modularization In this section, we summarize the module concept of GRACE brie y. More details can be found in [12] [4], 9] 14] 15] A transformation unit speci es a binary relation on graphs depending on the choice of the used binary relations in the import part. But how can the used relations be chosen One possibility is that relations are stored in some relation library and may be called by their names. ....

[Article contains additional citation context not shown here]

Drewes, F., P. Knirsch, H.-J. Kreowski and S. Kuske, Graph transformation modules and their composition, in: M. Nagl, A. Schurr and M. Munch, editors, Proc. Applications of Graph Transformations With Industrial Relevance, Lecture Notes in Computer Science 1779, 2000, pp. 15-30.

No context found.

F. Drewes, P. Knirsch, H.-J. Kreowski, and S. Kuske, Graph transformation modules and their composition, Proc. AGTIVE 1999 (M. Nagl, A. Schurr, and M. Munch, eds.), 2000, pp. 15--30.

No context found.

Drewes, F., P. Knirsch, H. J. Kreowski and S. Kuske, Graph transformation modules and their composition, in: M. Nagl, A. Schurr and M. Munch, editors, Proc. AGTIVE 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