J. Rekers, A. Schuerr. A Graph Based Framework for the Implementation of Visual Environments, Proceedings of the IEEE Symposium on Visual Languages 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....approaches fall into one of two categories: the ones with a graphlike model and the ones without such a model. DiaGen is a member of the first category. Other approaches and tools which are based on a graph like model are GenGEd [1] Kogge [8] VisPro [24] and the approach by Rekers and Schurr [20]. With the exception of DiaGen and Reker s and Schurr s approach, all of them support syntax directed editing only. Editing operations primarily modify the graph like model, and the visual representation of the model is adapted accordingly. Direct manipulation as described in Section 2 which ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In Proc. 1996.

....the same time would combine the positive aspects of both editing modes and reduce their negative ones. Despite this observation, there is only one such proposal which has not yet been realized known to us: Rekers and Schurr propose to use two kinds of graphs as internal representations of diagrams [5]: the spatial relationship graph (SRG) abstracts from the physical diagram layout and represents higher level spatial relations. Additionally, an abstract syntax graph (ASG) that represents the logical structure of the diagram is kept up to date with the SRG. Contextsensitive graph grammars are ....

.... diagrams [19] syntax diagrams [16] a visual # calculus [25] ladder diagrams [26] MSC [17] UML class diagrams, signal interpreted Petri nets and SFC diagrams [27] The approach which has been presented in this paper appears to be quite similar to the approach of Rekers and Schurr [5] which has already been outlined in Section 1. Both approaches make use of two hypergraphs resp. graphs. The spatial relationship graph (SRG) in Reker s and Schurr s approach is quite similar to the hypergraph model of DiaGen. But their abstract syntax graph (ASG) which represents the abstract ....

[Article contains additional citation context not shown here]

J. Rekers, A. Schurr, A graph based framework for the implementation of visual environments, in: Proc. 1996 IEEE Symp. on Visual Languages, Boulder, Colorado, IEEE Computer Society Press, 1996, pp. 148--155.

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

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In

....defined connection constraint. 4 Related Work Many different formalisms have been proposed for the definition of VLs [MM98] In contrast to existing approaches using either algebraic techniques [D U98] or graph grammar approaches as presented by Gottler [Got87] Andries, Engels, Rekers, Schurr [RS96,AER98] and Minas, Viehstaedt [MV95,Min98] our approach uses both for defining an alphabet and a language grammar [BTMS99] We use algebraic specification techniques to define graphical symbols, links and layout constraints in an axiomatic way. This seems to meet the definition of the very basic ....

J. Rekers and A. Schurr. A Graph Based Framework for the Implementation of Visual Environments. In Proc. IEEE Symp. on Visual Languages, pages 148--155, Boulder, Colorado, September 1996.

....them (for a survey see [18] but DiaGen is the only tool which supports free hand editing 10 as well as syntax directed editing in the same editor although combining both modes combines their bene ts, too. The only similar approach which is based on connected graph grammars has not been realized [19,20]. Recently, there has been some other work which integrates approaches for specifying and generating visual editors with animation concepts. Bardohl et al. have proposed an idea of using graph transformation rules of the GenGEd tool not only as speci cations of editing operations, but also of ....

J. Rekers, A. Schrr, A graph based framework for the implementation of visual environments, in: Proc. 1996 IEEE Symp. on Visual Languages, Boulder, Colorado, IEEE Computer Society Press, 1996, pp. 148155.

....system combines user directed design of visualizations with automatic knowledge based completion of partial visualization specifications. SAGE allows interactive modification of visualizations at runtime in the sense of data exploration but not in the sense of data manipulation. Schuerr and Rekers [9] present an approach to generate visual language environments with Progres. The visual language is defined by an abstract syntax graph and a spatial relationship graph with graph grammars. The final layout is assigned by the DeltaBlue constraint solver and the Fresco user interface builder. The ....

J. Rekers, A. Schuerr. A Graph Based Framework for the Implementation of Visual Environments, Proceedings of the IEEE Symposium on Visual Languages 1996, Boulder, Colorado, Sept. 1996, Los Alamitos: IEEE Computer Society Press, 1996.

....thus limited to fairly stable notations. Graph grammar based rules for mapping informal specification notations to formal models can solve the aforementioned problems by suitably merging the two classes of approaches. A multiple graph grammar setting similar to the one proposed by Andy Schurr in [21, 18] can be used as the formal framework to define mapping rules that can better cope with evolving notations. Differently from other rule based approaches, the formal foundation of graph grammars can simplify the problems derived from the need of quickly changing interpretation, by supporting ....

REKERS, J., AND SCH URR, A. A Graph Based Framework for the Implementation of Visual Environments. In Proceedings of VL'96 12th International IEEE Symposium on Visual Languages (September 1996), IEEE-CS Press.

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

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In [VL'96], 1996.

....graph, the so called abstract syntax graph (ASG) An ASG provides the information about the syntax and semantics of a visual sentence in a more succinct form. It is geared towards the interpretation or compilation of the regarded sentence. The distinction between ASGs and SRGs as introduced in [86] has been inspired by the Model View Controller concept of Smalltalk and the traditional distinction between abstract and concrete syntax for textual languages. It is a prerequisite for modeling those visual languages, which offer different representations of the same concept simultaneously ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In [114], pages 148--155, 1996.

....in form of text fields or combo boxes support additional, mostly text oriented, data input and manipulation. On the other hand there are systems for generation of visual interactive systems. They can be distinguished in ffl systems for the generation of visual language environments like VLCC [3, 5], and ffl approaches to the specification and generation of interactive visual interfaces by Dialogue Nets, Petri Nets, UAN (User Action Notation) and ODSN (Object oriented Dialogue Specification Notation) etc. 4, 6] Considering all the above approaches we can generally observe that user ....

J. Rekers, A. Schuerr. A Graph Based Framework for the Implementation of Visual Environments. In Proc. 1996 IEEE Symp. on Visual Languages, Boulder, Colorado, Sept. 1996.

....Considering this aspect it is similar to MetaEdit [11] a meta CASE system, which has an editor to customize and combine existing symbols. VIVID [5] focuses on database interfaces and allows to define symbols for the automatic generation of presentations of database contents. Rekers and Schurr [13] made a proposal which separates abstract syntactical aspects and visual aspects but all the visual information is in the graph without substructuring into units that are more closely related to the symbols. An intermediate result of the proposal was implemented in Progres. The symbols used in ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In 1996 IEEE Symposium on Visual Languages (VL'96), pages 148--155. IEEE, IEEE Computer Society Press, September 1996.

....supports both editing modes at the same time would combine the positive aspects of both editing modes and reduce their negative ones. Despite this observation, there is only one such approach known to us: Rekers and Sch urr propose to use two kinds of graphs as internal representations of diagrams [10]: the spatial relationship graph (SRG) abstracts from the physical diagram layout and represents higher level spatial relations. Additionally, an abstract syntax graph (ASG) that represents the logical structure of the diagram is kept up to date with the SRG. Context sensitive graph grammars are ....

....supporting both editing modes in one editor, we hope to combine the positive aspects of both modes, i.e, unrestricted editing capabilities and convenient syntax directed editing. The approach which has been presented in this paper appears to be quite similar to the approach of Rekers and Sch urr [10] which has already been outlined in Sec. 1. Both approaches make use of two hypergraphs resp. graphs. The spatial relationship graph (SRG) in Reker s and Sch urr s approach is quite similar to our SRHG. But their abstract syntax graph (ASG) has been introduced for a di erent reason than our HGM: ....

[Article contains additional citation context not shown here]

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In 1996 IEEE Symp. on Visual Languages, Boulder, CO. Sept. 1996, pp. 148-155.

....to specific visual languages. Others take an algebraic view of modeling picture semantics [18] Work that is most closely related to this paper is Erwig s definition of visual language semantics using abstract syntax graphs [5] and the separation of concrete and abstract syntax proposed in [1, 13]. Erwig uses abstract syntax graphs that abstract from representation details of concrete diagrams. He does not restrict semantic definition to this representation, but uses different schemes, e.g. denotational semantics, to define diagram semantics based on abstract syntax. However, he does not ....

....syntax. However, he does not offer a method for translating a concrete diagram into its abstract syntax representation. Rekers et al. have proposed to use spatial relationship graphs (SRGs) to represent a diagram s concrete syntax and an abstract syntax graph (ASG) for its abstract syntax [1, 13]. The syntax of each of the graphs is represented by a graph grammar. By coupling both grammars, they are able to translate SRGs into ASGs and vice versa. The correspondence between ASG and SRG is represented by special edges connecting ASG nodes by corresponding SRG nodes. These coupled grammars ....

[Article contains additional citation context not shown here]

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In VL'96 [16], pages 148--155, 1996.

....to specific visual languages. Others take an algebraic view of modeling picture semantics [25] Work that is most closely related to this paper is Erwig s definition of visual language semantics using abstract syntax graphs [7] and the separation of concrete and abstract syntax proposed in [2, 17]. Erwig uses abstract syntax graphs that abstract from representation details of concrete diagrams. He does not restrict semantic definition to this representation, but uses different schemes, e.g. denotational semantics, to define diagram semantics based on abstract syntax. However, he does not ....

....syntax. However, he does not offer a method for translating a concrete diagram into its abstract syntax representation. Rekers et al. have proposed to use spatial relationship graphs (SRGs) to represent a diagram s concrete syntax and an abstract syntax graph (ASG) for its abstract syntax [2, 17]. The syntax of each of the graphs is represented by a graph grammar. By coupling both grammars, they are able to translate SRGs into ASGs and vice versa. The correspondence between ASG and SRG is represented by special edges connecting ASG nodes by corresponding SRG nodes. The approach which is ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In VL'96 [23], pages 148--155, 1996.

....have been used as internal models. Among others, multisets of tokens (Marriott 1994) attributed symbols (Bottoni et al. 1995) and different kind of graphs and hypergraphs. Among the graphs, typical examples are graphs where nodes represent tokens and edges represent relations between tokens (Rekers Schurr 1996), special graphs where nodes have distinct connection points which are then used by edges for representing connections (Zhang Zhang 1997) and hypergraphs in our DiaGen project where visual tokens (diagram components) are represented by hyperedges and connections between them by nodes (Minas ....

....model from the visual representation, some kind of graphical scanning is necessary. Examples of related concepts are the visual programming environment for implementing visual languages VLCC by Costagliola et al. Costagliola et al. 1997) and the proposed visual environment by Rekers and Schurr (Rekers Schurr 1996). VLCC is distinguishes between connection based and geometric based diagrams. For connection based ones, the user specifying the visual language can define connection points for each visual token, i.e. atomic diagram component. When using the generated editor, the user can connect such ....

Rekers, J., and Schurr, A. 1996. A graph based framework for the implementation of visual environments. In VL'96 (1996), 148--155.

....available. Several concepts have been used as internal models. Among others, multisets of tokens [11] attributed symbols [3] and different kind of graphs and hypergraphs. Among the graphs, typical examples are graphs where nodes represent tokens and edges represent relationships between tokens [18], special graphs where nodes have distinct connection points which are then used by edges for representing connections [28] and hypergraphs in our DiaGen project where visual tokens (diagram components) are represented by hyperedges and connections between them by nodes [12, 15] Hyper) Graphs ....

....algorithms and (hyper) graph parsing. The following list selects only some approaches. In the field of frameworks for diagram editors there are several related approaches; the most closely related ones are VLCC by Costagliola et al. 5] the proposed visual environment by Rekers and Schurr [18], and GenGEd by Bardohl and Taentzer [1] Costagliola et al. use an object oriented hierarchy for representing diagrams according to their syntactic models instead of a uniform representation by hypergraphs as in this work. For connecting visual components, their VLCC system uses attachment points ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In [26], pages 148--155, 1996.

....An ASG provides the information about the syntax and semantics of a visual sentence in a more succinct form. It is geared towards the interpretation or compilation of the regarded sentence. 1.3. DEFINING THE SYNTAX OF VISUAL LANGUAGES 13 The distinction between ASGs and SRGs as introduced in [55] has been inspired by the Model View Controller concept of Smalltalk and the traditional distinction between abstract and concrete syntax for textual languages. It is a prerequisite for modeling those visual languages, which offer different representations of the same concept simultaneously ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In [2], pages 148--155, 1996.

....their diagram components. For details of the following brief outline see [5] There are several related approaches in the field of frameworks for VL environments based on diagrams; the most closely related ones are VLCC by Costagliola et al. 2] and the visual environment by Rekers and Schurr [7]. However, none of them allows for specifying diagram dynamics. VLCC uses an object oriented hierarchy for representing diagrams according to their syntactic models instead of a uniform representation as in our work. For connecting visual components, VLCC uses attachment areas quite similar as ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In Proc. VL'96, pages 148--155, 1996.

....P 3 . Figure 9 shows the appropriately extended reversed productions. Related Work In the field of frameworks for visual language environments based on diagrams there are several related approaches; the most closely related ones are VLCC by Costagliola et al. 1997) the visual environment by Rekers and Schurr (1996), and the VisPro toolset based on reserved graph grammars by Zhang and Zhang (1997) In contrast to the three building principles of diagrams presented in this paper, Costagliola et al. distinguish two main syntactic models for visual languages. The connectionbased one corresponds with our ....

Rekers, J. and Schurr, A. (1996). A graph based framework for the implementation of visual environments. In VL'96 (1996), pages 148--155.

....language editors. There exist many approaches to visual language specification. A complete overview would be out of scope of this paper. The most closely related approaches are constraint multiset grammars (CMGs) 9] GenEd [10] and a visual language environment proposed by Rekers and Schurr [11]: 1) CMGs are a generalization of context free hypergraph grammars: A single lhs nonterminal token can be recognized from a rhs multiset of tokens as long as they satisfy production specific constraints on spatial relationships. CMGs are used to recognize diagrams where a diagram is represented ....

J. Rekers and A. Schurr, "A graph based framework for the implementation of visual environments", In VL'96 [22], pp. 148--155.

....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 considerations wrt. graphical ....

....graphical (context sensitive) parsing ( RS95b, RS95a] is regarded, and it is more concrete defined how to represent a visual program ( AER96] corresponding to the two structures mentioned above. Figure 6 illustrates the several representations of a visual program. Within the last contribution ( RS96] a graph based framework for the implementation of visual environments is presented. The aim of this framework is to introduce an architecture for storing visual sentences within an environment which supports several kinds of editing (syntax directed, free and layout editing) The architecture ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In [VL'96], 1996.

....we hope to obtain a better insight in the applicability of the developed graph grammar formalism. Furthermore, this will allow us to analyze the efficiency of the parser on actual visual sentences. The implementation will become part of a syntax directed editor toolkit for visual languages [1, 19] under development, and the graph grammar programming environment PROGRES [23, 24] Acknowledgements We would like to thank the referees of the JVLC for their extensive and helpful comments on the first version of this paper. ....

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. Submitted to VL'96, 1996.

No context found.

J. Rekers, A. Schuerr. A Graph Based Framework for the Implementation of Visual Environments, Proceedings of the IEEE Symposium on Visual Languages 1996.

No context found.

J. Rekers and A. Schrr. A graph based framework for the implementation of visual environments. In 1996.

No context found.

J. Rekers and A. Schurr. A graph based framework for the implementation of visual environments. In Proc. 1996 IEEE Symp. on Visual Languages, Boulder, Colorado, pages 148-155, 1996.

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