Schurr, A., Specification of graph translators with triple graph grammars, in: Proc. WG'P4 Workshop on Graph-Theoretic Concepts in Computer Science, 1994, pp. 151--163. 14 Mens et al.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....tools assist in propagating changes and performing consistency analysis. The integration tools are driven by triple rules which define relationships between design documents. 1 Introduction Triple graph grammars, an extension of pair graph grammars [1] were introduced at the WG 94 workshop [2]. Originally, they were motivated by integration problems in software engineering; later, they were applied to other domains as well. In general, triple graph grammars may be used for the specification of graph translations, coupling of graph structures, and consistency maintenance. This paper ....

....conclusion. 2 Triple Graph Grammars Pair graph grammars were introduced as early as 1971 by Pratt to specify graph tograph translations [1] A pair grammar defines a set of pair productions which modify the participating graphs and update correspondences between nodes. Triple graph grammars [2] are an extension of pair graph grammars. They were motivated by the study of integration problems in software engineering environments [6] These studies showed the need for a separate correspondence graph to be placed in between source and target graph. The terms source and target denote ....

[Article contains additional citation context not shown here]

Schurr, A.: Specification of graph translators with triple graph grammars. In Mayr, E.W., Schmidt, G., Tinhofer, G., eds.: Proceedings 20th Workshop on Graph-Theoretic Concepts in Computer Science WG 1994. LNCS 903, Herrsching, Germany, Springer (1994) 151--163 Simon M. Becker and Bernhard Westfechtel

....with OCL constraints [1, 11, 17] Operational approaches these techniques describe the process of a model transformation from the source to the target language. Such a specification mainly combines metamodeling with (c) graph transformation [5, 8, 9, 14, 27] d) triple graph grammars [22] (e) term rewriting rules [28] or (f) XSL transformations [6, 19] Many of the previous approaches already tackle the problem of automating model transformations in order to provide a higher quality of transformation programs compared with manually written ad hoc transformation scripts. Problem ....

A. Schurr. Specification of graph translators with triple graph grammars. In . Tinhofer (ed.), Proc. WG94: International Workshop on Graph-Theoretic Concepts in Computer Science, no. 903 in LNCS, pp. 151--163. Springer, 1994.

....a metamodel with OCL constraints [1, 12] Operational approaches these techniques describe the process of a model transformation from the source to the target language. Such a specification mainly combines metamodeling with (c) graph transformation [3,5,6,8,21,22] d) triple graph grammars [18] (e) term rewriting rules [23] or (f) XSL transformations [15] Problem statement Even though many of these approaches tackle the automated generation of model transformation programs and provide a precise mathematical and conceptual background for them, only research prototype tools exist for ....

A. Schurr. Specification of graph translators with triple graph grammars. In . Tinhofer (ed.), Proc. WG94: International Workshop on Graph-Theoretic Concepts in Computer Science, no. 903 in LNCS, pp. 151--163. Springer, 1994.

....Splitting Region 1 L L L b) Aspen Plus L L Fig. 1. PFD in Comos PT, Aspen Plus simulation corresponding to Region 1 collecting integration rules, algorithms for applying these rules, and wrappers for tool encapsulation. It is funded on theoretical work in the area of graph transformations [11]. With the help of the framework, the effort for building specific integration tools is reduced considerably. The rest of this paper is structured as follows: Section II introduces a motivating example, from which requirements to integration tools are derived in Section III. Section IV, which ....

....integrated a priori, i.e. a common user interface, database, etc. was assumed. Moreover, integration tools were hardcoded. In contrast, our current work addresses a posteriori integration. Rules can be defined on the fly, and they can be interpreted or compiled as desired. Triple graph grammars [11] provide the theoretical background of our work. This approach was also applied in the REforDI project [2] which was concerned with re design of legacy applications, and in Varlet [7] which addressed database reengineering. In both projects, integration tools were specified in PROGRES, a ....

A. Schurr. Specification of graph translators with triple graph grammars. In E. Mayr, G. Schmidt, and G. Tinhofer, editors, Proceedings WG `94 Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 903, pages 151--163, Herrsching, Germany, June 1994. Springer-Verlag.

....define all necessities ( 17] Many different formalisms have been proposed for the definition of VLs (cf. 12] for a survey over the common approaches. In contrast to common approaches including algebraic techniques ( 21] as well as to the graph grammar approaches presented by Rekers, Schurr ([14, 18, 1, 15]) and Minas, Viehstaedt ( 22, 13] our approach uses two different techniques for defining the alphabet on the one side and the language grammar on the other side. We use algebraic specification techniques to define graphical symbols, interrelations and layout constraints in an axiomatic way. ....

A. Schurr. Specification of Graph Translators with Triple Graph Grammars. In Proc. 20th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 151--163. LNCS 903, 1994.

....ASG can be reconstructed as side effect. In the introduction we have made a very strict distinction between the Spatial Relations Graph, the Abstract Syntax Graph, and their connection, while the graph grammar definition presented merges them into a single, too complex, graph. Triple Graph Grammars[12] promise to solve this problem, as in that formalism the three concepts can be defined separately, but this still is theory under development. ....

A. Schurr. Specification of Graph Translators with Triple Graph Grammars. In Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 904, pages 151--163, 1994.

....a visual language by algebraic techniques is to have a theory behind that allows for further analysis of the language, like consistency checks, layout constraints, etc. Our work is closely related to others applying algebraic specification techniques [Usk94] or graph grammars [Min93, Rek94, Sch94] to visual languages. Although these approaches show nicely that algebraic specifications as well as graph grammars can be applied to visual language definition, and tool support for graphical editing can be generated, these approaches and also other common approaches [MM96] do not distinguish ....

....visual language in a natural way. The proper language, i.e. its grammatical structure, is described by a graph grammar techniques which is again a very natural formalism for this purpose. Our work is closely related to others applying graph grammars to visual languages. Within the work of [Rek94, Sch94, RS95, AER96, RS96] graph grammars are used to define visual languages 12 by giving the logical structure (abstract syntax) together with the spatial relations. Graphical (context sensitive) parsing is regarded, and it is defined how to represent a visual program. Attributed graphs represent the ....

A. Schurr. Specification of Graph Translators with Triple Graph Grammars. In Proc. 20th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 151--163. LNCS 903, 1994.

....how ASGs and SRGs are related to each other, i.e. how an update of one graph is translated into an update of the related 120 CHAPTER 3. APPLICATION TO VISUAL LANGUAGES graph. In the most general case the relationships between ASGs and SRGs are modeled as coupled graph grammars as introduced in [80,93]. Assuming that any ASG graph grammar production is related to a single SRG graph grammar production and vice versa, it is a straightforward task to keep the ASG and SRG derivation histories and thereby the underlying graphs in a consistent state. In the absence of explicitly represented ....

A. Schurr. Specification of graph translators with triple graph grammars. In Proc. of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, number 904 in Lecture Notes in Computer Science, pages 151--163, Berlin, 1994. Springer Verlag.

....A more complicated translation process is necessary which interweaves deriving with the HGM grammar and generating with the ASG grammar. It is not yet clear whether such ASG grammars are really needed for the purpose of translation. However, this still is work in progress. Triple graph grammars [14] are a starting point for a solution of those problems. 6. Conclusions and Future Work This paper has presented a grammar based method for translating diagrams into a hypergraph which serves as an abstract representation of the diagram. Diagrams that are translated by this method have to be ....

A. Schurr. Specification of graph translators with triple graph grammars. In Proc. of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, number 904 in Lecture Notes in Computer Science, pages 151--163, Berlin, 1994. Springer Verlag.

....and creates results, that have to be translated back into the diagram language, the unparsing problem has to be solved. This unparsing problem requires parsing of the interpreter results and creating a diagram in correspondence with the derivation of the interpreter result. Triple graph grammars [18] appear to be a starting point for solving this problem. ....

A. Schurr. Specification of graph translators with triple graph grammars. In Proc. of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, number 904 in Lecture Notes in Computer Science, pages 151--163, Berlin, 1994. Springer Verlag.

....approach. Until now, we did not explain how ASGs and SRGs are related to each other, i.e. how an update of one graph is translated into an update of the related graph. In the most general case the relationships between ASGs and SRGs are modeled as coupled graph grammars as introduced in [58,59]. Assuming that any ASG graph grammar production is related to a single SRG graph grammar production and vice versa, it is a straightforward task to keep the ASG and SRG derivation histories and thereby the underlying graphs in a consistent state. In the absence of explicitly represented ....

A. Schurr. Specification of graph translators with triple graph grammars. In Proc. of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, number 904 in Lecture Notes in Computer Science, pages 151--163, Berlin, 1994. Springer Verlag.

....efficient parsing of visual languages. In the introduction we have made a very strict distinction between the Spatial Relations Graph, the Abstract Syntax Graph, and their connection, while the graph grammar definition presented merges them into a single, too complex, graph. Triple Graph Grammars[Sch94] promise to solve this problem, as in that formalism the three concepts can be defined separately, but this still is theory under development. 2 The user might want to do this to improve the default layout manually. 14 Marc Andries, Gregor Engels, Jan Rekers Acknowledgments: The authors would ....

A. Schurr. Specification of Graph Translators with Triple Graph Grammars. In Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 904, pages 151--163, 1994.

....in [And96, AE97] Graph Rewrite Systems and Visual Database Languages. Use of attributed and labeled graphs (PROGRES [Zun92, SZW95] defines syntax and semantics of a visual database language; without considerations wrt. graphical structure. 4. Rekers Schurr Engels Andries in [Rek94, Sch94, RS95b, RS95a, AER96, RS96] How to represent a Visual Program and A graph based framework for the implementation of visual environments Use of attributed and labeled graphs (PROGRES [Zun92, SZW95] defines syntax of visual languages, graphical parsing, and a graph based framework; with ....

....with graph rewriting and visual languages. 3.4 How to represent a Visual Program The earliest work we found was [Rek94] where graph grammars are used to define the logical structure (called abstract syntax) as well as to define the view (called spatial relations) of diagrammatic expressions. Sch94] provides triple graph grammars to hold theses two structures, which is said to define a visual language. Within following articles graphical (context sensitive) parsing ( RS95b, RS95a] is regarded, and it is more concrete defined how to represent a visual program ( AER96] corresponding to the ....

A. Schurr. Specification of Graph Translators with Triple Graph Grammars. In Proc. 20th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 903 of LNCS, pages 151--163. Springer, 1994.

....Digit Digit : 0j1j2j3j4j5j6j7j8j9 The parse tree for the number 123 is shown on the left hand side of figure 2, with its abstract syntax tree on the right. The latter is obviously a lot closer to the notion of a sequence of digits that it can be seen to represent. As proposed by Schurr [20], a similar notion could be exploited for graph grammars by coupling the application of a graph grammar production in e.g. a spatial relationships graph sentential form to the application of a mirror production in another, more abstract grammar in another sentential form, the corresponding ....

A. Schurr. Specification of graph translators with triple graph grammars. In Mayer and Tinhofer, editors, Proceedings international workshop on Graph-Theoretic concepts in Computer Science -- WG'93, will appear in LNCS, 1995.

No context found.

Schurr, A., Specification of graph translators with triple graph grammars, in: Proc. WG'P4 Workshop on Graph-Theoretic Concepts in Computer Science, 1994, pp. 151--163. 14 Mens et al.

No context found.

Schurr, A.: Specification of graph translators with triple graph grammars. In: Proceedings 20th Workshop on Graph-Theoretic Concepts in Computer Science. (1994) 151--163

No context found.

Schurr, A.: Specification of graph translators with triple graph grammars. In: Proc. of the 20th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 1994). LNCS 903, Herrsching, Germany, Springer (1995) 151--163

No context found.

Schurr, A., Specification of Graph Translators with Triple Graph Grammars, in: G. Tinhofer, editor, Proc. WG'94 20th Int. Workshop on Graph-Theoretic Concepts in Computer Science, number 903 in LNCS (1994), pp. 151--163.

No context found.

A. Schurr. Specification of graph translators with triple graph grammars. Tech. rep., RWTH Aachen, Fachgruppe Informatik, Germany, 1994. 19

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