M. Lwe, M. Beyer, "AGG -- An Implementation of Algebraic Graph Rewriting," Fifth Intl. Conf. on Rewriting Techniques and Applications, Montreal, Canada, June 1993, in LNCS 690, Springer, pp. 451-456.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....called views. In [19] two views of a graph are created so that the transformation of one view updates the other consistently. Multilevel graph grammars [33] define the transformation of graphs wherein details can be hidden by abstracting transformations that can be undone as needed. The graphs in [30] support rigidly layered views. Graphs and the morphisms between them are abstracted to nodes and edges of the next layer. Let us finally discuss some aspects of our notion of transformation which are related to concepts discussed in the literature. In the hierarchical setting, the ability of ....

M. Lwe and M. Beyer, AGG---An implementation of algebraic graph rewriting, in "Proc. Rewriting Techniques and Applications," Lecture Notes in Computer Science, Vol. 690, pp. 451--456, Springer-Verlag, New York/Berlin, 1993.

....The AGG Tool Set Started in the beginning of 1997, the development of the graph transformation system Agg(for Algebraic Graph Grammar system) is an on going activity, putting into practice the algebraic single pushout approach [Low93] with several extensions. Although retaining the name Aggfrom [LB93] the system is redesigned from scratch, merely taking over some ideas and concepts from its predecessor. The implementation is done purely in Java, a modern object oriented, platform independent programming language. The Aggsystem provides a platform for realization and illustration of ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, volume 690 of LNCS, pages 451--456. SpringerVerlag, 1993.

....aim of GENGED is to support the convenient specification of VLs, and to generate graphical editors. Theoretical support, e.g. allowing analysis of the specified languages is as important as tool support. This theory is based on well developed concepts and tools for algebraic graph transformations ([8, 5, 11]) and can be used for further analysis of the language like consistency checks, layout constraints, etc. 10, 27] A more comprehensive discussion on the definition of VLs by algebraic specification techniques and graph grammars in combination with GENGED, e.g. Petri nets, Statecharts, Sequence ....

....a visual specification is a sentence of the GENGED language consisting of all visual specifications which can be derived by the GENGEDrules. The manipulation of GENGED sentences, i.e. the visual specification of visual languages, is supported by the integrated graph transformation machine AGG ([11, 16]) together with the graphical constraint solver PARCON ( 9] AGG is responsible for the logical structure of a visual specification, i.e. the graph structure, and PARCON manages the visual structure the user works with. The paper is organized as follows: Section 2 treats our running example ....

[Article contains additional citation context not shown here]

M. Lowe and M. Beyer. AGG --- An Implementation of Algebraic Graph Rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer, 1993.

....of messages in the system is called ICS (System s communications interface) Everything that occurs during a PROSOFT session is done through the ICS. Research is being done to model formally the ICS using (an extended version of) CCS. PROSOFT is an object based environment. AGG (TUB) Bey93, LB93] AGG is an algebraic graph grammar system implementing the single pushout approach to graph transformations [Low90] It comprises a window based graph editor and a derivation component. The editor supports different views of a graph that can be displayed in several windows simultaneously. Several ....

M. Lowe and M. Beyer, AGG --- An Implementation of Algebraic Graph Rewriting, Accepted at the Fifth Int. Conf. on Rewriting Techniques and Applications, 1993.

....this paper we introduce a conceptual model of the graphical editor GENGED supporting the visual definition of VLs based on an algebraic framework. In this framework VLs are based on algebraic graph grammars. The manipulation of sentences is done by the integrated graph transformation system AGG ( LB93] together with the graphical constraint solver PARCON ( Gri96] GENGED can be used to define several kinds of VLs because it allows any kind of connections. Furthermore, GENGED offers a hybrid language allowing the user to annotate graphical symbols with string sentences. These are the ....

M. Lowe and M. Beyer. AGG --- An Implementation of Algebraic Graph Rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer, 1993.

....entering of graph rules, their automatic application and even the generating of stand alone prototypes. However, it is not capable of modeling distributed systems, and it isn t based on algebraic formal semantics. The work on an Algebraic Graph Grammar system Agg started as early as 1991 [Bey91, LB93] The result was a graph editor which offered limited transformation support. An attempt to extend that system [Win95] made clear that re designing was necessary, with a stress on portability and modularity. Therefore, several system components are being developed simultaneously, communicating ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456, 1993.

....isomorphic to the left hand side of the rule. Hence the labelled subgraph problem must be solved in each rewriting step. Current implementations follow two strategies to deal with the problem. They either keep the problem open to the user who determines an isomorphic subgraph interactively [LBe93], Him89] or in advance [KiMa92] or they perform a full search [Zn92] Neither strategy is satisfying with respect to a fast execution which is a key condition for a broader use of graph rewriting. In general the subgraph isomorphism problem lies in NP for undirected and directed labelled graphs ....

Lwe, Michael; Beyer, Martin: `AGG --- An Implementation of Algebraic Graph Rewriting' in Kirchner, Claude (ed.) Rewriting Techniques and Applications, Montreal, Canada, June 16-18, 1993, LNCS 690, Springer, Berlin, 1993, pp.451-456.

....languages with UML s generic (parameterised) classes in a completely new way. There are a number of other approaches which can be found in the graph grammar community to specify VL programming environments. One of the representatives is GenGEd [1] which is based on the graph rewriting system AGG [5]. GenGEd is a generator for graphical editors and allows for a seperate definition of a visual alphabet and transformation rules. Another visual programming environment is Fujaba [7] Fujaba transforms UML diagrams into Java source code and vice versa. However, these approaches are very new and ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456. Springer-Verlag, 1993.

....believe that modeling with graphs and graph rewriting systems leads to inherently inefficient implementations due to the NP completeness of many graph algorithms. Nowadays the situation is gradually improving with the appearance of graph rewriting system (graph grammar) implementations like AGG [28], GraphED [22] PAGG [17] and our system PROGRES [36] There exist even plans to combine the efforts of different research groups to develop a graph centered environment, called Grace, which encompasses at least the functionality of the systems AGG and PROGRES [25] The essential idea of all ....

....27, 31] Using these criteria, a surveyable number of visual languages remain for inspection. Compared with PROGRES their deficiencies come from the following sources: in many cases these languages focus on manipulation of data structures only and data definition sublanguages are not provided [3, 22, 28]. And even systems like VAMPIRE with its class hierarchies and icon rewriting rules [30] and PAGG with its node type definitions and graph rewriting rules [17] come without a rigid type concept and without any type checking tools. Therefore, all these systems postpone recognition of programming ....

Lwe M., Beyer M.: AGG - An Implementation of Algebraic Graph Rewriting, in: Proc. 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, Berlin: Springer Verlag (1993), 451-456

....transformation is applied to actor systems in [Kor94] In [TB94] Beyer and Taentzer use parallel graph transformation systems based on the doublepushout (DPO) approach to specify AGG, an algebraic graph grammar system. The AGG system, which implements the SPO approach, is briefly described in [LB93] and [Bey93] Graph interpreted graph transformations were proposed as an adequate means for specifying 26 concurrent object oriented systems [Kor93a] and in more detail in [Kor95] An alternative approach for specifying concurrent object oriented systems using so called object oriented ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer Verlag, 1993.

....support the graphical definition of the syntax of a visual language. The graph grammar definition forms the basis for the generation of those editors where syntax directed drawing is supported. Therefore, the framework will use a graph transformation based environment as given by the AGG system [LB93] By applying graph grammar rules syntax directed editing operations are performed. This paper is organized as follows: In the following section, we give a brief overview over the formal concepts we use within this paper. In section 3 we present our concepts how to define a visual language by ....

....presented in section 3. This environment generates several graphical editors from user definitions. Figure 8 illustrates the structure of these generated editors. Since we define visual languages by graph grammars, the environment is based on a graph transformation machine as e.g. the AGG System ( LB93] Furthermore, to handle graphical constraints it must contain a graphical constraint solver as given by e.g. the ParCon System ( Gri93] The definition of the symbol vocabulary and links is supported by the GraphicEditor illustrated on the left side of Figure 8. This editor contains three ....

[Article contains additional citation context not shown here]

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456, 1993.

....25 years ago. Meanwhile there is a well established theory of graph transformations (cf. EKR91,CEER96] which has a number of useful applications to system modelling and software engineering (cf. Nag96,Zam96,AE96,SWZ95] based on concrete specification languages and supporting tools (cf. Sch91,LB93] The main idea of our specification approach using graph transformations is to model object structures and their interrelationships by graphs and modifying operations by graph transformations. This specification approach is in line with the object oriented paradigm where static and dynamic ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer Verlag, 1993.

....development of the graph transformation system Agg at TU Berlin started with the realization of a flexible graph editor plus an accompanying small 10 Java is a trademark of Sun Microsystems, Inc. 164 CHAPTER 3. APPLICATION TO VISUAL LANGUAGES graph transformation component programmed in Eiffel [64]. Agg has been reimplemented in Java to open it for flexible attribute computations. In this way, Agg becomes a general purpose language where a new programming paradigm, i.e. graph transformation, is incorporated into the object oriented paradigm. A further aim of Agg is to make graph ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456. Springer-Verlag, 1993.

....graphs of [24, 13] have compound nodes. Pratt [24] considers only language generation similar to Example 7, and Engels and Schurr [13] do not consider transformation at all. Schneider [27] considers graphs that have (simple) graphs as node and edge labels. The graphs of the old Agg system [20] support a rigid layering: Graphs, and the mappings between them can be viewed and manipulated as nodes and edges on the next layer of abstraction. This helps to structure the systems rather than the graph values. Predicates exist in Progres [28] but without graph and predicate parameters. The ....

Michael Lowe and Martin Beyer. AGG --- an implementation of algebraic graph rewriting. In Claude Kirchner, editor, Proc. Rewriting Techniques and Applications, number 690 in Lecture Notes in Computer Science, pages 451--456. Springer, 1993.

....semantics of programming languages. His graph concept was extended in [6] by allowing edges between subgraphs contained in different nodes, but without defining transformation. A different concept of graph nesting is given by the abstraction mechanisms of the (old) graph transformation system Agg [12] and the multi level graph grammars of [13] providing flat graphs with several views which are related by a rigid layering and a partial inclusion ordering, respectively. An indirect nesting concept can be found in the framework of [16] and the new Agg system [7] where nesting is realized by ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In C. Kirchner, editor, Proc. Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456, 1993.

....The methods and techniques of graph transformation have been under development for almost three decades now, although little e#orts have been devoted within the graph transformation community to issues of tool support. A few notable exceptions are the systems GraphEd [4] PROGRES [8] Agg [5], and Treebag [3] Grammatica is a prototype implementation of double pushout algebraic graph transformation [2] based on relation algebra [1, 7] It has originated in an investigation of the extent to which algebraic graph transformation can be expressed within relation algebra [6] and has ....

M. Lowe and B. M. Beyer. Agg: An implementation of algebraic graph rewriting. In Proc. 5th Int. Conf. on Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456. Springer-Verlag, 1993.

....Work Structured graphs have already been proposed several authors: Hierarchical graphs of [15, 8] have compound nodes. Pratt [15] considers only language generation similar to example 2, and Engels and Schurr [8] do not (yet) consider transformation at all. The graphs of the old Agg system [13] support a rigid layering: Graphs and the mappings between them are abstracted to the nodes and edges of the next layer. This helps to structure the systems rather than the graphs values. The new Agg system [21] supports hierarchical graphs via a by pass to the implementation language ....

Michael Lowe and Martin Beyer. AGG --- an implementation of algebraic graph rewriting. In Claude Kirchner, editor, Proc. Rewriting Techniques and Applications, number 690 in Lecture Notes in Computer Science, pages 451--456, 1993.

....and rule base rewriting systems are quite popular among computer scientists, their combination in the form of graph rewriting systems were more or less unknown for a long time. Nowadays the situation is gradually improving with the appearance of graph rewriting system implementations like AGG [19], GraphED [15] PAGG [11] or GOOD [14] Unfortunately, all these systems have their main focus on the definition of graph rewrite rules only, and they either have no proper means to model integrity constraints and derived properties of data structures or they do not offer any constructs to ....

....[13, 17] Using these criteria, a surveyable number of visual languages remains for inspection. Compared with PROGRES their deficiencies come from the following sources: in many cases these languages focus on manipulation of data structures only and data definition sublanguages are not provided [3, 15, 19]. And even systems like VAMPIRE with its class hierarchies and icon rewriting rules [21] and PAGG with its node type definitions and graph rewriting rules [11] come without a rigid type concept and without any type checking rules and tools. Therefore, all these systems postpone recognition of ....

Löwe M., Beyer M.: AGG - An Implementation of Algebraic Graph Rewriting, in: Proc. 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, Berlin: Springer Verlag (1993), 451-456

....on the other hand about 25 years ago. Meanwhile there is a well established theory of graph transformations (see e.g. 9] which has a number of applications to system modelling and software engineering (cf. 10, 11, 12, 13] based on concrete specification languages and supporting tools (cf. [14, 15]) The main idea of our specification approach is to model object structures and their interrelationships by A Combined Reference Model and View Based Approach to System Specification 4 reference model view1 rename embed embed embed embed rename view2 system model define views integrate ....

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer Verlag, 1993.

....in graph rewriting, in particular for automatically executing graph rewrite systems. PROGRES [SWZ95] as well as its variant UBS systems [Dor95] require that control flow is stated together with the rules to guarantee termination. Other systems are more oriented towards interactive graph rewriting [LB93]. Also in artificial intelligence rule based systems have been built. Among the newer works are [Mir] and [Pac95] which embed production rules into C and Smalltalk. These systems use the RETE LEAPS pattern match algorithms to find rule matches in their workspace. However, it is unclear whether ....

Michael Lowe and Martin Beyer. AGG --- an implementation of algebraic graph rewriting. In Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456. Springer-Verlag, 1993.

....algebraic graph grammars, parallel graph transformation 1 Introduction Although graph grammars have been investigated for more than 20 years only few graph grammar systems exist. For example, IPSEN [Nag87, Sch91] PAGGED [Got87a] or GraphEd [Him91] The algebraic graph grammar system Agg ([Bey91, LB93]) is a prototype implementation of the single pushout approach to graph rewriting. Agg is a purely graphical system, consisting of a graph editor and a transformation component. It combines the intuitiveness of graphical presentations made accessible by current workstation technology with the ....

....e.g. a gluing operation which merges two objects to a new object inheriting the incidence relations of the original objects and a copy operation drawing edges between all original nodes and edges and their copies. These operations facilitate the input of transformation rules. A simple example (cf. [LB93]) of a transformation rule is shown in figure 1. The abstraction concept is supported conveniently by the editor. It is possible to create objects in different abstraction levels before defining the abstraction function. Another possibility is the operation create abstraction : The user selects a ....

M. Lowe and M. Beyer, AGG --- An Implementation of Algebraic Graph Rewriting, LNCS 690, Springer, 1993, Rewriting Techniques and Applications, Fifth Int. Conf., RTA'93.

No context found.

M. Lwe, M. Beyer, "AGG -- An Implementation of Algebraic Graph Rewriting," Fifth Intl. Conf. on Rewriting Techniques and Applications, Montreal, Canada, June 1993, in LNCS 690, Springer, pp. 451-456.

No context found.

Michael Lowe and Martin Beyer. AGG --- an implementation of algebraic graph rewriting. In Rewriting Techniques and Applications, volume 690 of Lecture Notes in Computer Science, pages 451--456. Springer-Verlag, 1993.

No context found.

Lowe M., Beyer M.: AGG - An Implementation of Algebraic Graph Rewriting, in: Proc. 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, Springer Verlag (1993), 451-456

No context found.

M. Lowe and M. Beyer. AGG --- an implementation of algebraic graph rewriting. In Proc. Fifth Int. Conf. Rewriting Techniques and Applications, '93, LNCS 690, pages 451--456. Springer Verlag, 1993.

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