MINAS, M. Hypergraphs as a uniform diagram representation model. In Ehrig et al. [16], pp. 281 -- 295.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....values Layered GG Graph Graph Graph No Layering Exponential Reserved GG Graph Graph Graph Yes Selection free Polynomial The six attributes used to distinguish various grammars in the table are proposed by Rekers and Schurr [9] They serve our purpose well in comparing these grammars. Minas [20] has recently adapted RGGs to the DiaGen hypergraph environment [21] The selection free constraint imposed in RGGs is relaxed to allow more types of hypergraphs to be specified. However, additional information has to be provided in the form of negative application conditions (NACs) A production ....

Minas, M. (2000) Hypergraphs as a uniform diagram representation model. Lecture Notes in Computer Science, 1764, 281--295.

....spatial relationships while the user is editing the diagram. This is the task of a graphical scanner which has to be efficient since detection of spatial relationships has to be performed during user interaction. Therefore, a general pattern recognition approach is unsuited. The papers [Min98a, Min98b] propose an efficient scanning procedure for this purpose. The diagram class specification which is used by DiaGen mainly consists of a hypergraph grammar which describes the diagrams syntax in terms of their hypergraph models. In previous work, only context free hypergraph grammars with ....

....is used by DiaGen mainly consists of a hypergraph grammar which describes the diagrams syntax in terms of their hypergraph models. In previous work, only context free hypergraph grammars with optional embedding rules [BMST99] have been used, which may be parsed efficiently. The papers [Min98a, Min98b] propose a parsing procedure for a much more general hypergraph grammar class. More recent work has investigated how to translate a diagram into an abstract representation which can be used, e.g. for diagram semantics. As before, diagrams are represented by hypergraphs which are created from the ....

Mark Minas. Hypergraphs as a uniform diagram representation model. In G. Engels and G. Rozenberg, editors, Pre-Proc. 6th International Workshop on Theory and Applications of Graph Transformation (TAGT'98), number tr--ri--98--201 in Reihe Informatik, pages 24--31. Universitat--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik, 1998.

.... 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 issues of a visual language in a natural ....

M. Minas. Hypergraphs as a Uniform Diagram Representation Model. In Proc. Theory and Application of Graph Transformation, pages 24--31, Paderborn, Germany, November 1998.

....Rose for UML [Cor99] or application specific environments for, e.g. telecommunication, GENGED comes up with a generic approach and a generic environment. Furthermore, GENGED supports the visual specification of visual modeling techniques in contrast to textual specifications as proposed in [Min98] 5 Conclusion We have introduced our concept of model evolution and have illustrated the basic notions using the telephone example. The main ideas are on the one hand, a concept of representing a system on two levels, and on the other hand, a rulebased approach for the description of system ....

M. Minas. Hypergraphs as a Uniform Diagram Representation Model. In Proc. Theory and Application of Graph Transformation, pages 24--31, Paderborn, Germany, November 1998.

.... example, Engels et al. From Trees to Graphs 5 can not be generated by a hyper edge replacement graph grammar, because the number of edges in the graphs generated by such a grammar is bounded [14] For this reason, visual language definitions often have to resort to non context free grammars (cf. [36, 31]) As a consequence, the concept of derivation tree as representation of the process of constructing a sentence is no longer applicable. In fact, in order to record the history of a sentence generated by a context sensitive grammar, a directed acyclic graph (DAG) is required, where the degree of ....

....grammars as well as graph grammars as long as the usual concept of non terminal is present. In the literature on graph grammars, non context free grammars and corresponding notions of concrete and abstract syntax are discussed mainly in the context of visual language definitions (see, e.g. [36, 2, 31, 4, 8] or the survey [5] The theoretical study of such grammars has received relatively little attention. see, however, 27] in this volume) Beside the idea of abstract syntax as a simplified history of the generation of a sentence, which is tightly connected to the use of grammars, in diagram ....

MINAS, M. Hypergraphs as a uniform diagram representation model. In Ehrig et al. [16], pp. 281 -- 295.

.... Generic Model for Diagram Syntax and Semantics BERTHOLD HOFFMANN Universit at Bremen MARK MINAS Universit at Erlangen In this extended abstract, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN [9, 10, 11], and outline a visual, rulebased, and object oriented programming language based on graph transformation by which DIAGEN can be extended to model the semantics of diagrams as well. This language is generic w.r.t. the diagram notation to be used in the programmed visual system. Diagram Syntax ....

MINAS, M. Hypergraphs as a uniform diagram representation model. In Theory and Application of Graph Transformation (TAGT'98), Selected Papers (2000), H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, Eds., no. 1764 in Lecture Notes in Computer Science, Springer, pp. 281--295.

....hyperedge tentacles being connected to common nodes in the hypergraph model. DiaGen creates a low level graphic editor that allows to manipulate pictorial objects of the specified VL; the internal hypergraph model is modified accordingly by watching the pictorial objects attaching areas [70]. Free hand editing with parser support relaxes the need to specify a full set of transformations on diagrams for syntax directed editing since free hand editing can be used for (yet) unspecified diagram operations. Therefore, this editing mode enhances usability of editors and also makes rapid ....

M. Minas. Hypergraphs as a uniform diagram representation model. In Prelim. Proc. 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), pages 24--31. UniversitatGesamthochschule Paderborn, Technical Report tr-ri-98-201, Reihe Informatik, November 1998.

....one since undirected edges can always be represented by two directed edges with opposite direction . ing the existence or non existence of certain context. Path expressions [3] can be used to require that a certain path of (hyper) edges exists in the host hypergraph. Negative application context [7, 11], on the other hand, is an additional subgraph of the LHS. The production must not be applied if this subgraph can be matched into the host hypergraph, too. Examples for both kinds application context are described together with Fig. 7. In the following, we will use (hyper) graphs as diagram ....

M. Minas. Hypergraphs as a uniform diagram representation model. In Preliminary Proc. 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), Paderborn, Germany, pages 24--31. University of Paderborn, Technical Report tr-ri-98-201, Nov. 1998.

....of software systems in order to make them user friendlier. The use of diagrams in computers does not only call for a precise specification of their syntax and semantics, but also for tools that support their recognition, processing, and drawing. In this paper, we first review the DIAGEN system [9, 10, 11], which allows the syntax of diagram languages to be specified by graph grammars, and generates diagram editors dedicated to these languages. We then outline a visual, rule based, and object oriented programming language based on graph transformation by which the semantics of diagrams can be ....

MINAS, M. Hypergraphs as a uniform diagram representation model. In Theory and Application of Graph Transformation (TAGT'98), Selected Papers (2000), H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, Eds., no. 1764 in Lecture Notes in Computer Science, Springer, pp. 281--295.

....editor framework and a generator. A formal specification of a diagram language serves as input for the generator which creates custom components that build together with the framework a graphical editor customized for the specified diagram language. Main features, which have been described in [12, 14, 19, 13], are: 12 : fb in fb out fb in Ladder a b main Defs a b main Defs FBs b a FBs a FB a FB FBs a FB a Or fb in a FbOr fb in a fb in a Defs a b Def a b Defs Def a b Def a b out Or a b out FbOr b Or a b And Or b ....

M. Minas. Hypergraphs as a uniform diagram representation model. In Preliminary Proc. 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), Paderborn, Germany, pages 24--31. University of Paderborn, Technical Report tr-ri-98-201, Nov. 1998.

....hyperedge tentacles being connected to common nodes in the hypergraph model. DiaGen creates a low level graphic editor that allows to manipulate pictorial objects of the specified VL; the internal hypergraph model is modified accordingly by watching the pictorial objects attaching areas [80]. Free hand editing with parser support relaxes the need to specify a full set of transformations on diagrams for syntax directed editing since free hand editing can be used for (yet) unspecified diagram operations. Therefore, this editing mode enhances usability of editors and also makes rapid ....

M. Minas. Hypergraphs as a uniform diagram representation model. In Prelim. Proc. 6th International Workshop on Theory and Application of Graph Transformations (TAGT'98), pages 24--31. UniversitatGesamthochschule Paderborn, Technical Report tr-ri-98-201, Reihe Informatik, November 1998.

No context found.

MINAS, M. Hypergraphs as a uniform diagram representation model. In Ehrig et al. [16], pp. 281 -- 295.

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