Taentzer, G., Fischer, I., Koch, M., and Volle, V., Distributed Graph Transformation with Application to Visual Design of Distributed Systems, to appear in Rozenberg, G. (ed.), Graph Grammar Handbook 3: Concurrency and Distribution, World Scientific, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....hand, the graphs to be transformed by a graph transformation system may be so large that they should be split up into smaller more understandable pieces. The structuring of graphs as well as the transformation of structured graphs has been studied in a series of papers (see e.g. 24, 10, 28] [29, 3, 5]) In this paper we combine the concept of transformation units with a structuring concept for graphs to overcome both above mentioned burdens of large systems. More precisely, we show how distributed graphs can be transformed by distributed transformation units. The distributed graphs, we ....

....units at the same time as long as the boundary graphs are preserved. 4. 1 Distributed graphs The basic distribution structure of distributed graphs and distributed transformation units is re ected by a bipartite graph connecting a set of local nodes with a set of interface nodes (cf. also [29]) De nition 5 (Distribution structure) 1. A distribution structure is a tuple NG = LocV ; IntV ; Att) where LocV is a set of local vertices, IntV is a set of interface vertices and Att LocV IntV is a set of edges attaching local vertices to interface vertices. The set LocV [ IntV is ....

[Article contains additional citation context not shown here]

Gabriele Taentzer, Manuel Koch, Ingrid Fischer, and Victor Volle. Distributed graph transformation with application to visual design of distributed systems. In Ehrig et al. [8], pages 269-340.

....channels are regarded as nodes and the processes as (hyper) edges. However, the purpose of [45] is to de ne formal semantics for concurrent programming languages, while our purpose is to provide an experimental platform for observing the runtime behaviour of distributed systems. The purpose of [56] is similar to ours, namely: tool support for design and examination of distributed software systems. Dealing with brokers, objects and interfaces, their approach less abstract and closer to software engineering than ours, which is mainly concerned with the abilities of basic distributed ....

....distributed software systems. Dealing with brokers, objects and interfaces, their approach less abstract and closer to software engineering than ours, which is mainly concerned with the abilities of basic distributed algorithms. Also their notion of distributed graph transformation is di erent: in [56], a distributed graph represents distributed data and it is the graph itself whose subgraphs are arbitrarily distributed over the network. In their approach, computation is externally performed on the (passive) graph, while our computation is performed in the (active) graph. Thus, their ....

Gabriele Taentzer, Manuel Koch, Ingrid Fischer, and Victor Volle. Distributed graph transformation with application to visual design of distributed systems. chapter 5, in [16], pages 269340.

No context found.

I. Fischer, M. Koch, G. Taentzer, and V. Volle. Distributed Graph Transformation with Application to Visual Design of Distributed Systems. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution, pages 269-340. World Scienti c, 1999.

....is designed in a way that consistency of the network as well as of all object and data structures involved is ensured. Throughout this contribution all formal concepts are introduced on an intuitive level in order to be comprehensible. Distributed graph transformation is formally presented in [18,6]. 2 Distributed Graph Transformation Several graph transformation approaches exist which have been used to model distributed systems. One big advantage of these approaches is the rule based nature of dynamics description. Rules are well suited to describe recon guration in distributed systems, ....

....an occurrence of the left hand side has to be chosen. In addition to the dangling condition for all local rules and the network rule some additional application conditions have to be checked in order to guarantee a distributed graph as result. These conditions are explained in more detail in [6]) Formally, a distributed graph transformation step is formulated by a doublepushout in the category of distributed graphs and graph morphisms. On this basis, the existence and uniqueness of a distributed graph transformation step can be shown. This coherence is extremely useful for modeling ....

[Article contains additional citation context not shown here]

I. Fischer, M. Koch, G. Taentzer, and V. Volle. Distributed Graph Transformation with Application to Visual Design of Distributed Systems. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution, pages 269-340. World Scientic, 1999.

....wrt. a visual specification, i.e. for each sort symbol exists a carrier set and for each operation symbol exists an operation, and equations (not described until now) are satisfied by each algebra. The graph part is given by total operations whereas the data and attribute parts are partial (cf. [7,104]) The graph like logical part of the algebra, i.e. the visual sentence illustrated by Figure 3.3 (c) is presented in Figure 3.9. The carriers are visualized by rectangles with a leading number followed by its type inside. Each operation is visualized by an arrow. The algebraic approach allows ....

G. Taentzer, I. Fischer, M. Koch, and V. Volle. Distributed graph transformation with application to visual design of distributed systems. In [34], chapter 5.

....between the independent development of single local ViewPoints and the configuration and connection of a set of related ViewPoints in a structured way. Distributed graph transformation which is based on the double pushout approach to algebraic graph transformation is introduced formally in [6]. Using AGG [7] as a computing platform an adequate level of tool support can easily be constructed. The manipulation of representation schemes is expressed as graph transformation rules and the interaction and cooperation of distributed ViewPoints is adequately formulated as distributed graph ....

Taentzer, G., Fischer, I., , Koch, M., and Volle, V., "Distributed Graph Transformation with Application to Visual Design of Distributed Systems", in Rozenberg, G. (ed.), Graph Grammar Handbook 3: Concurrency & Distribution, World Scientific,1999.

....in a structured way. The concepts as well as the formal definition of distributed graph transformation are based on the double pushout approach to algebraic graph transformation [1] where basic concepts from category theory are applied. Distributed graph transformation is introduced formally in [11]. The ViewPoints framework was devised by A. Finkelstein et al. 5] and B. Nuseibeh [10] to describe complex systems. An overview of other approaches related to multiple perspectives in software development can be found in [6] In [10] a general overview wrt inconsistency management is given. ....

Taentzer, G., Fischer, I., , Koch, M., and Volle, V., "Distributed Graph Transformation with Application to Visual Design of Distributed Systems", to appear in Rozenberg, G. (ed.), Graph Grammar Handbook 3: Concurrency & Distribution, pp. 269 -- 340, World Scientific, 1999.

....To achieve this we choose to implement the complete framework 1 in Java TM . This decision allows us to offer SCM services even over the World Wide Web. 2. Architecture In the following we describe a give an overview of the architecture of COMAND.A more complete description can be found in [20, 15]. 2.1. Configurations are Revisions, too Selecting a revision of a document from a repository has been rather straightforward since the days of SCCS or RCS: You could ask for a revision EITHER with a given revision number or with a label. Each has to be unique with regard to all other revisions ....

....of the application of all these non distributed rules, i.e. network rule and local rules. We have to mention, however, that some additional conditions for the embedding has to be satisfied in order to guarantee this component wise application. These conditions are explained in more detail in [14, 15]. Moreover, distributed rules can be furnished with application conditions as in the non distributed case. 3.2. Modeling replication with distributed graph transformations In the following we explain the formal specification of the replication mechanism. The complete specification of COMAND by ....

[Article contains additional citation context not shown here]

G. Taentzer, I. Fischer, M. Koch, and K. V. Volle. Distributed Graph Transformation with Application to Visual Design of Distributed Systems. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformations. Vol. III: Concurrency and Distribution. World Scientific, 1998. to appear.

....To achieve this we choose to implement the complete framework 1 in Java TM . This decision allows us to offer SCM services even over the World Wide Web. 2. Architecture In the following we describe a give an overview of the architecture of COMAND. A more complete description can be found in [20, 15]. 2.1. Configurations are Revisions, too Selecting a revision of a document from a repository has been rather straightforward since the days of SCCS or RCS: You could ask for a revision EITHER with a given revision number or with a label. Each has to be unique with regard to all other revisions ....

....of the application of all these non distributed rules, i.e. network rule and local rules. We have to mention, however, that some additional conditions for the embedding m has to be satisfied in order to guarantee this component wise application. These conditions are explained in more detail in [14, 15]. Moreover, distributed rules can be furnished with application conditions as in the non distributed case. 3.2. Modeling replication with distributed graph transformations In the following we explain the formal specification of the replication mechanism. The complete specification of COMAND by ....

[Article contains additional citation context not shown here]

G. Taentzer, I. Fischer, M. Koch, and K. V. Volle. Distributed Graph Transformation with Application to Visual Design of Distributed Systems. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformations. Vol. III: Concurrency and Distribution. World Scientific, 1998. to appear.

....wrt. a visual specification, i.e. for each sort symbol exists a carrier set and for each operation symbol exists an operation, and equations (not described until now) are satisfied by each algebra. The graph part is given by total operations whereas the data and attribute parts are partial (cf. [69,70]) The graph like logical part of the algebra, i.e. the visual sentence illustrated by Figure 1.3 (c) is presented in Figure 1.9. The carriers are visualized by rectangles with a leading number followed by its type inside. Each operation is visualized by an arrow. The algebraic approach allows ....

G. Taentzer, I. Fischer, M. Koch, and V. Volle. Distributed graph transformation with application to visual design of distributed systems. In [119].

No context found.

Taentzer, G., Fischer, I., Koch, M., and Volle, V., Distributed Graph Transformation with Application to Visual Design of Distributed Systems, to appear in Rozenberg, G. (ed.), Graph Grammar Handbook 3: Concurrency and Distribution, World Scientific, 1999.

No context found.

Gabi Taentzer, Manuel Koch, Ingrid Fischer, and Victor Volle. Distributed graph transformation with application to visual design of distributed systems. In Handbook on Graph Grammars and Computing by Graph Transformation: Concurrency, Parallelism, and Distribution, volume 3, pages 269--340. World Scientific, 1999.

No context found.

Taentzer, G., Koch, M., Fischer, I., Volle, V.: Distributed graph transformation with application to visual design of distributed systems. In: Handbook on Graph Grammars and Computing by Graph Transformation: Concurrency, Parallelism, and Distribution. Volume 3. World Scientific (1999) 269--340

No context found.

I. Fischer, M. Koch, G. Taentzer, and V. Volle. Distributed Graph Transformation with Application to Visual Design of Distributed Systems. In Ehrig et al. [EKMR99], pages 269{ 340.

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