Frank Drewes, Berthold Hoffmann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64:249--283, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....available online at http: www.idealibrary.com on Hierarchical Graph Transformation This work has been partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR Research Network GETGRATS. A short version of this paper appeared in the proceedings of FOSSACS 2000; see [14]. Frank Drewes Institutionen fr Datavetenskap, Ume Universitet, S 90187 Ume, Sweden E mail: drewes cs.umu.se Berthold Hoffmann Fachbereich Mathematik Informatik, Universitt Bremen, Postfach 33 04 40, D 28334 Bremen, Germany E mail: hof informatik.uni bremen.de and Detlef Plump Department ....

....denote by A H the set V H E H of atoms of H. In order to make this a useful notation, we shall always assume without loss of generality that V H and E H are disjoint, for every graph H. Remark. In order to avoid confusion we remark that the hypergraphs used in the short version of this paper [14] come with an additional component, namely a sequence of distinguished nodes called points. These are useful in connection with hyperedge replacement [13] which is employed by the flattening process considered in Section 6. However, as long as one is not interested in flattening, and in ....

F. Drewes, B. Hoffmann, and D. Plump, Hierarchical graph transformation, in "Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000)," Lecture Notes in Computer Science, Vol. 1784, pp. 98--113, Springer-Verlag, New York/Berlin, 2000.

....The question may not be hard to answer, since the requirements are quite sharp; for example, are the conditions of a WRS (Definition 12) satisfied if topographs are generalised to directed acyclic graphs Variations are possible within the tree like topography. Drewes, Hoffmann and Plump [5] generalise DPObased graph rewriting to hypergraphs in which a subgraph may be assigned to each hyperedge. However, no links can exist between the subgraph and its parent; instead, such links may be formed when the subgraph is promoted to top level as a result of a transformation. With this ....

Drewes, F., Hoffmann, B. and Plump, D. (2000), Hierarchical graph transformation. In Proc. Conference on Foundations of Software Science and Computation Structures (FoSSACS'00), LNCS 1784, Springer Verlag, 33pp.

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

....a comparable system behaviour. In [15] graph multiset transformation is presented which is inspired by the concepts of genetic algorithms and DNA computing and is closely related to our concurrent semantics of transformation units. Finally, transformation of structured graphs is considered in e.g. [5, 9]. 6 Conclusion In the presented approach to distributed graph transformation distributed graphs and distributed transformation systems are represented as labelled bipartite graphs consisting of local vertices and interface vertices. In the rst case the local vertices are labelled with local ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 2002. To appear; short version in Proc. FOSSACS 2000, LNCS 1784.

....other langauge elements can be handled. In complex cases the integration of various UML diagrams may lead to large diagrams which are di cult to handle and to understand. Therefore, for practical use, structuring concepts for graphs should be incorporated in the presented approach (cf. e.g. [35, 22, 15, 7, 9]) For being able to use our approach in practice, adequate transformation tools are needed. It should be investigated in which way existing tools can be employed to achieve this aim. A further interesting question is how far the presented integration approach can be used for consistency ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 2002. To appear; short version in Proc. FOSSACS 2000, LNCS 1784.

....(i.e. reaction rules placed at a certain hierarchy can act only on processes at that hierarchy) 3. Transformation. LMNtal has a rewrite rule based syntax. There has been a lot of work on graph grammars and graph rewriting transformation [1] including hierarchical graph transformation [4], but LMNtal s emphasis is on its design from the programming language point of view. The key design issue has been how to deal with free links properly. Rewrite rules specify reaction between elements of a multiset, but reaction between interlinked elements can in general be much more e#cient ....

Drewes, F., Ho#mann, B. and Plump, D., Hierarchical Graph Transformation. J. Comput. Syst. Sci., Vol. 64, No. 2 (2002), pp. 249--283.

....power for specifying and programming with transformation units. A thorough study of the theory of transformation units is presented in the thesis [Kus00b] If systems are speci ed by graph transformation, large graphs should be structured in order to be comprehensible. The papers [DHP00a, DHP00b] present an approach for the rule based transformation of hierarchically structured (hyper)graphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. This framework extends the wellknown double pushout approach from at to hierarchical graphs. The paper shows ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Informatik-Bericht 1/00, Universit at Bremen, 2000. 33 pages.

....expressive power for specifying and programming with transformation units. A thorough study of the theory of transformation units is presented in the thesis [Kus00b] If systems are speci ed by graph transformation, large graphs should be structured in order to be comprehensible. The papers [DHP00a, DHP00b] present an approach for the rule based transformation of hierarchically structured (hyper)graphs. In these graphs, distinguished hyperedges contain graphs that can be hierarchical again. This framework extends the wellknown double pushout approach from at to hierarchical graphs. The ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000), volume 1784 of Lecture Notes in Computer Science, pages 98{ 113. Springer-Verlag, 2000.

No context found.

F. Drewes, B. Homann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249-283, 2002. 15

No context found.

F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64:249--283, 2002.

No context found.

F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64:249--283, 2002.

No context found.

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249-283, 2002.

No context found.

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Informatik-Bericht 1/00, Universit at Bremen, 2000. 33 pages.

No context found.

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. In Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2000), 113. Springer, 2000.

.... model, since practically every kind of diagram can be abstractly represented as a graph, even if the diagram itself does not look graph like [1] In order to reach the expressive power of recursive data structures in conventional languages, graphs have earlier been extended by a concept of nesting [5]. In contrast to related notions of hierarchical graphs that are used for software modeling [3,7] This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph) 1 Email: hof tzi.de Email: minas informatik.uni erlangen.de c 2001 ....

....from this interface, e.g. via menu entries. This triggers execution of the operation, including the necessary transformations of diagrams to graphs, and back again. 7 Conclusions We have extended graphs by a compositional notion of nesting. These graphs are no longer called hierarchical (as in [5,11]) since this term is mostly used for structured graphs with structure crossing edges that are not compositional. We have devised a notion of nested graph transformation that extends the rewriting of terms [13] which are trees over function symbols) to trees over graphs (namely, nested graphs) in ....

[Article contains additional citation context not shown here]

F. Drewes, B. Homann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, to appear 2001.

....on a new idea of high level constraints. Two main results concerning compositionality show that semantics and correctness for a system can be inferred from that of its components. The concepts are illustrated by a running example on modeling Java threads by high level nets. Update: KBK01] and [DHP02] have now appeared, the latter paper was described in the 3rd Progress Report. 3.1.2 Parallellism and Concurrency In [JV01] and [Ver02] it is shown that the process theory of Local Action Systems can be instantiated for the special case of Petri Nets. Considering various straightforward ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249-283, 2002.

....Science see the recent handbook volumes [40, 17, 18] Graph transformation has been used, for exam1 This work has been partially supported by the ESPRIT Working Group APPLIGRAPH and the TMR Research Network GETGRATS. A short version of this paper appeared in the proceedings of FOSSACS 2000, see [14]. ple, as an ecient computational model for term rewriting systems and functional programming languages [34, 5] and for specifying visual languages and generating associated editors [4, 31] Besides speci c applications of graph transformation, several programming languages have been developed ....

....We denote by AH the set VH [ EH of atoms of H . In order to make this a useful notation, we shall always assume without loss of generality that VH and EH are disjoint, for every graph H . Remark. In order to avoid confusion we remark that the hypergraphs used in the short version of this paper [14] come with an additional component, namely a sequence of distinguished nodes called points. These are useful in connection with hyperedge replacement [13] which is employed by the attening process considered in Section 6. However, as long as one is not interested in attening, and in particular ....

Frank Drewes, Berthold Homann, and Detlef Plump. Hierarchical graph transformation. In Proc. Foundations of Software Science and Computation Structures (FOSSACS 2000), volume 1784 of Lecture Notes in Computer Science, pages 98-113. Springer-Verlag, 2000.

.... model, since practically every kind of diagram can be abstractly represented as a graph, even if the diagram itself does not look graph like [1] In order to reach the expressive power of recursive data structures in conventional languages, graphs have earlier been extended by a concept of nesting [5]. In contrast to related notions of hierarchical graphs that are used for software modeling [3,7] This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (APPLIGRAPH) Email: hoftzi.do Email: minasinformatik.uni erlangen.de ( 2001 Published by ....

....from this interface, e.g. via menu entries. This triggers execution of the operation, including the necessary transformations of diagrams to graphs, and back again. 7 Conclusions We have extended graphs by a compositional notion of nesting. These graphs are no longer called hierarchical (as in [5,11]) since this term is mostly used for structured graphs with structure crossing edges that are not compositional. We have devised a notion of nested graph transformation that extends the rewriting of terms [13] which are trees over function symbols) to trees over graphs (namely, nested graphs) in ....

[Article contains additional citation context not shown here]

F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, to appear 2001.

....a notion of hierarchical graph transformation [4] that is generic, i.e. not committed to a particular kind of graphs or graph transformation, and decouples the package structure from the underlying graph. The existing approaches of Hgraph grammars [16] and hierarchical hypergraph transformation [6] are then compared by translating them to the generic notion. This shows up their similarities and di erences clearly, and demonstrates that the generic notion may simulate many notions of hierarchical graphs. Space does only permit to outline de nitions and results, which will be given in the ....

....derivations as triples of NLC derivation steps. Proposition 1 Let H and H 0 be two given H graphs, an H grammar, p a rule of , and r = p ; p ; p ) the translation of p to a hierarchical graph rule. Then H ) p H 0 i HG(H) V r HG(H 0 ) 4 Hierarchical Hypergraph Transformation In [6], hierarchical hypergraph transformation is de ned as a computational basis for programming with graphs [14] A hypergraph is nite, and consists of nodes and labelled hyperedges that may be attached to any number of nodes. In a hierarchical hypergraph, some 4 of the hyperedges (called frames) ....

[Article contains additional citation context not shown here]

F. Drewes, B. Homann, and D. Plump. Hierarchical graph transformation. Journal on Computer and System Science, 2001. Accepted for publication.

....by other tools. For a better integration of semantics, we plan to extend DIAGEN by a programming language that allows operations to be specified directly on the abstract syntax graphs of diagrams. The concepts of such a language have been discussed in [8] and its formal basis has been defined in [5]. Here we just state its key features, and give two small examples. Graph Transformation Rules. Computation is based on matching the pattern of some rule in a host graph, removing the occurrence of that pattern up to those nodes where it may be clipped from the remainder of the host graph, and ....

....Thus normalize could be used to apply join to a diagram as long as possible. Graph Nesting. The notion of graphs is extended by a concept for nesting graphs within graphs. We allow certain kinds of edges, called frames, to contain nested subgraphs. Such graphs are called hierarchical in [5]. In our example, the edge labelled by the procedure call P( in Figure 2 could be a frame that contains the abstract control flow graph of P. For the sake of modularity, there may be no edges across frame boundaries (which other notions of nested graphs allow, e.g. 6] However, every link of ....

DREWES, F., HOFFMANN, B., AND PLUMP, D. Hierarchical graph transformation. In Foundations of Software Science and Computation Structures (FOSSACS 2000) (Mar. 2000), J. Tiuryn, Ed., no. 1784 in Lecture Notes in Computer Science, Springer, pp. 98--113.

No context found.

Frank Drewes, Berthold Hoffmann, and Detlef Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64:249--283, 2002.

No context found.

Drewes, F., Ho#mann, B., Plump, D.: Hierarchical graph transformation. J. Comput. Syst. Sci. 64 (2002) 249--283

No context found.

Drewes, F., Hoffmann, B. and Plump, D. (2000) Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures, LNCS 1784, Springer Verlag.

No context found.

Drewes, F., Hoffmann, B. and Plump, D. (2000) Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures, LNCS 1784, Springer Verlag.

No context found.

Drewes, F., Hoffmann, B. and Plump, D. (2000) Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures, LNCS 1784, Springer Verlag.

No context found.

Drewes, F., Ho#mann, B. and Plump, D., Hierarchical Graph Transformation. J. Comput. Syst. Sci., Vol. 64, No. 2 (2002), pp. 249--283.

First 50 documents

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