G. Engels, A.S. (1995). Encapsulated Hierarchical Graphs, Graph Types, and Meta Types.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....step on hierarchical graphs gives rise to a conventional step on the flattened graphs by using the flattened rule. We would like to stress that the strict hierarchical structure of our graphs provides certain advantages over approaches that allow edges between different component graphs, like [6, 21]. Edges across the component structure cause complications when it comes to reasoning about programs. In particular, they prevent compositionality of the form that component graphs can be freely replaced with equivalent components. Consider, for example, the equivalence on hierarchical graphs ....

....is used to define Hgraph languages that represent the semantics of programs, e.g. of Lisp expressions. Note that this is essentially a modelling rather than a programming situation, as the semantics of a source program is represented by a set of graphs. The hierarchical graphs defined in [21] are equipped with an acyclic package hierarchy as well as export and import relations defining admissible package crossing edges. However, transformational aspects are not investigated. In [6] transformation for a simpler version of such graphs is defined. The paper [20] where hierarchical ....

G. Engels and A. Schrr, Encapsulated hierarchical graphs, graph types, and meta types, in "Proc. Joint Compugraph/Semagraph Workshop on Graph Rewriting and Computation," Electronic Notes in Theoretical Computer Science, Vol. 2, http://www.elsevier.nl/locate/entcs, 1995.

....the mobility of multisets. LMNtal features multiset hierarchies and encapsulation by allowing a multiset of nodes to be a node. Hierarchical multisets can be found in the ambient calculus and the bigraphical model [9] as well as in the fields of formal languages [10] and knowledge representation [5]. The major di#erence from those models is in how the structuring and the nesting of nodes are combined. Hierarchization of multisets plays many important roles, for instance in (i) logical management of computation (e.g. user processes running under administrative processes) ii) physical ....

Engels, G. and Schurr, A., Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Electronic Notes in Theor. Comput. Sci., Vol. 1 (1995), pp. 75--84.

....for a di erent application, our model of hierarchical graph transformation does remind of triple graph grammars [18] which also provide some kind of amalgamation, but are tied to a particular graph transformation approach. Related work has studied encapsulation concepts for hierarchical graphs [12] (yet without notion of transformation) and the construction of views [9] on ( at) graphs. Further approaches to hierarchical graph transformation, namely hierarchical graph transformation with variables [6] typed hierarchical graph transformation [11] and Higraphs [15] shall be investigated ....

G. Engels and A. Schurr. Encapsulated hierarchical graphs, graph types and meta types. In A. Corradini and U. Montanari, editors, Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, number 2 in Electronic Notes in Theoretical Computer Science, http://www.elsevier.nl/locate/entcs, 1995. Elsevier. 7

....information (typically pages) and the edges represent hyperlinks. Graph grammars allow to specify complex transformations on graphs in a simple, intuitive way. Recent developments in graph grammars consider higher level structuring of graphs, among these hierarchical structuring (see e.g. [ES95], Bey93] BEMW] 1 2 Aim and Scope of the Theses This document was originally meant as a proposal for one master thesis. Since the resulting proposal was oversized as a master thesis, it has been split into several proposals research topics, most of which concentrate on a specific topic, and ....

G. Engels and A. Schurr. Encapsulated hierarchical graphs, graph types, and meta types. Technical Report 95-21, Departement of Computer Science, Leiden University, P.O. Box 9512, 2300 RA Leiden, The Netherlands, July 1995.

....interfaces. In loops with no crossing edges, the loop itself is the interface between its inside and the rest. So the subgraph inside a loop can be considered a subcomponent of the graph, interacting with the rest only via the enclosing loop. An immediate comparison with the hierarchical graphs in [3] is not possible since in that paper there is a notion of visibility . We expect to be able to simulate such a framework with the appropriate use of type graphs and labelling of vertices and loops. While a node source or target of an edge indicates that the node (or element represented) is in ....

G. Engels, A. Schurr. Encapsulated Hierarchical Graphs, Graph Types and Meta Types. inProc. SEGRAGRA (A.Corradini, U.Montanari eds.), Elect. Notes in TCS, 75--84, 1995.

....The model can be customized for different application areas, but can also serve as an intermediate implementation platform for other high level graph grammar programming languages. Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b] This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting 29 in encapsulated hierarchical graphs. Reusing the schema idea ....

Gregor Engels and Andy Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In Andrea Corradini and Ugo Montanari, editors, Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http://www.elsevier.nl/locate/entcs .

....The model can be customized for different application areas, but can also serve as an intermediate implementation platform for other high level graph grammar programming languages. Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b] This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting 29 in encapsulated hierarchical graphs. Reusing the ....

Gregor Engels and Andy Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Technical Report 95-21, Leiden University, Dept. of Comp. Science, July 1995.

....model can be customized for different application areas, but can also serve as an intermediate implementation platform for other high level graph grammar programming languages. 25 Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b] This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting in encapsulated hierarchical graphs. Reusing the schema idea of ....

G. Engels and A. Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In Andrea Corradini and Ugo Montanari, editors, Proc. Joint COMPUGRAPH /SEMAGRAPH Workshop on Graph Rewriting and Computation. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http://www.elsevier.nl/locate/entcs .

....The model can be customized for different application areas, but can also serve as an intermediate implementation platform for other high level graph grammar programming languages. 25 Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b] This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting in encapsulated hierarchical graphs. Reusing the schema ....

G. Engels and A. Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Technical Report 95-21, Leiden University, Dept. of Comp. Science, July 1995.

.... relationships into the world of graph grammars [10, 17] to encapsulate graph transformation algorithms by means of so called transformation units [20, 33] to adapt the concept of database views to graph data types [26] and to develop new concepts for the design of hierarchical graph structures [12] or distributed systems of graph objects [36] Taking all these sources of inspiration and the state of the art into account, we are currently developing a graph grammar module concept for the language PROGRES, which is intentionally kept as simple as possible. Its first version, presented here, ....

.... to complex node objects with associated graph transformation methods, ffl (vertical) refinement of graph types and their operations, ffl and modeling of distributed concurrently (inter ) acting graph objects, First results of ongoing research activities concerning these problems may be found in [12, 17, 36]. Major efforts are still necessary to refine and merge their proposals for hierarchical graph data models, inheritance or refinement of graph types, and distributed programming with graph rewriting systems. It is a longer term research goal of the GRACE initiative to develop a single generic ....

G. Engels and A. Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In Corradini and Montanari [6].

....no means to refine relationships (edge types) or even graph types. It is a common goal of the graph grammar community to introduce modular programming and refinement into the world of graph grammar specifications. Therefore, a variety of publications have been presented concerning this issue (cf. [6, 16, 5, 9, 8]) But for most of these ideas it does not seem possible to apply them in a concrete programming language. To a large degree the problems found in the area of object oriented modeling are quite similar to the ones experienced with graph transformation systems. The advantage of the suggestions and ....

....refining the left and right sides of production rules in [8] is precisely defined, but does not seem transferable to complex operations composed by control structures. ffl Packages themselves may be nested and may therefore aggregate and encapsulate a complex internal structure. In contrast to [6], we do not intend to map this hierarchical specification structure onto aggregated graph objects. ffl In this presentation packages give no support for modeling of distributed concurrently (inter ) acting graph objects as in [16] In general, on one hand, major efforts are still necessary to ....

G. Engels and A. Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In Corradini and Montanari [2].

....transformation units. The introduced framework is independent of a particular graph transformation approach and hence may enhance the usefulness of graph transformation in many contexts. Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b]. This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting in encapsulated hierarchical graphs. Reusing the schema idea of ....

Gregor Engels and Andy Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. In Andrea Corradini and Ugo Montanari, editors, Proc. Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. To appear.

....transformation units. The introduced framework is independent of a particular graph transformation approach and hence may enhance the usefulness of graph transformation in many contexts. Engels and Schurr started to work on a concrete module concept for a graph grammar specification language [ES95a, ES95b]. This work is based on experiences from the software engineering field, where information hiding concepts like export and import interfaces are quite common. This has been combined with a new hierarchical graph data model resulting in encapsulated hierarchical graphs. Reusing the schema idea of ....

Gregor Engels and Andy Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Technical Report 95-21, Leiden University, Dept. of Comp. Science, July 1995.

....By means of graph rewrite rules, complex graph transformations may be specified in a declarative way on a high level of abstraction. 3) Programming adds considerable expressive power to the specification language. On the other hand, there are also some limitations which are partially addressed in [5]: 1) The current PROGRES environment does not yet support a module concept to structure large specifications. 2) PROGRES provides dynamic binding for attribute evaluation rules only. Object oriented concepts need to be supported more comprehensively (graphs as objects, redefinition of graph ....

G. Engels, A. Schurr. Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. SEGRAGRA '95, ENTCS, to appear (1995)

No context found.

Engels G., Schurr A.: Encapsulated Hierarchical Graphs, Graph Types, and Meta Types (long version), Technical Report 95-21, Dept. of Computer Science, Leiden University, July 1995

No context found.

G. Engels, A.S. (1995). Encapsulated Hierarchical Graphs, Graph Types, and Meta Types.

No context found.

Engels, G. and Schurr, A., Encapsulated Hierarchical Graphs, Graph Types, and Meta Types. Electronic Notes in Theor. Comput. Sci., Vol. 1 (1995), pp. 75-- 84.

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