V. Claus, H. Ehrig, and G. Rozenberg (Eds.), "Graph Grammars and Their Application to Computer Science and Biology, Selected Papers," Lecture Notes in Computer Science, Vol. 73, SpringerVerlag, New York/Berlin, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....graph g to g # , and g is more general than G, then r gives rise to a reduction r # from G to some new graph G # , where g # is more general than G # . This will be modeled by a pushout (cf. definition 4.1. 19) this being the standard way of expressing such reduction within a context (see e.g. ENRR87] Section 4.1 is rather long and technical, especially the proof that the pushout actually exists (section 4.1.5) However, in order to read the rest of this chapter it will be su#cient if one understands how graphs, specializations, reductions, sums and pushouts are defined 39 furthermore, ....

H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld, editors. Graph-Grammars and Their Application to Computer Science. Lecture Notes in Computer Science 291, 1987.

....j val : vn i Gamma hx 1 : T 1 j val : exp 1 (v)i : hx n : Tn j val : exp n (v)i 3.9 Graph Rewriting Different mathematical axiomatizations of graph rewriting have been proposed in the literature. The categorical approach using double or single pushouts has been studied quite extensively [50, 147]. However, for our purposes the most convenient axiomatizations are those in which labeled graphs are axiomatized equationally as an algebraic data type in such a way that graph rewriting becomes rewriting modulo the equations axiomatizing the type. Axiomatizations in this spirit include those of ....

H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph Grammars and their Application to Computer Science. Springer LNCS 532, 1991.

....different areas of computer science, suchas symbolic computation and term rewriting systems, abstract data type specifi functional programming languages and concurrency. The abstract concept of reduction affects different objects: terms [8] combinators and terms [6] proofs [11] graphs [5], polynomials [1] In [8] the concept of Abstract Reduction System is proposed, that, abstracting from the particular objects to which reduction apply, presents a unifying treatment of reduction, where some important concepts, such as confluence, noetherianity, normal form can be assessed. The ....

H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld. Graph grammars and their application to computer science. Springer-Verlag, L.N.C.S. 291, 1987.

....analyses the syntax tree, and generates a Combinatorial Model (an Entity Relationship Diagram) It does this by matching patterns in the syntax tree, and generating corresponding components in the Combinatorial Model. This process is similar to the construction of graphs through Graph Grammars [3], and is shown in Fig. 4. a x2 y2 x3 y3 a a x1 y1 Tree x y x y R Foreach subtree: entities relationships Find Create List x y a Pattern = Fig. 4. Combinatorial Model Generation Local Attribute Mapping: assigns graphical attributes to the entities and relationships of the ....

H. Ehrig, H.-J. Kreowski, G. Rozenberg, Graph Grammars and their Applications to Computer Science. Lect. Notes in Comp. Sc., vol. 532, Springer-Verlag. 1991.

....objects [Lin 84] The definition of formal grammars adapted by [Fu 74] for pattern recognition, especially string grammars or attributed string grammars, Tsai 80] You 80] is not very well adapted for modelling two dimensional patterns. Other grammars are more efficient: graph grammars [Claus 79] Bunke 82] tree grammars [Agui 79] or plex grammars [Fu 74] Bunke 92] These grammar parsers are sometimes difficult to implement; graph languages are more complex than string languages. Parsers have been proposed by [Fu 83] Flasi nski 89] In this paper we use the plex grammar formalism ....

....has been proposed: the formalism of graph grammar. In this formalism, the rewriting step operates on graphs, then the various relations between the components of a two (or n) dimensional structure are more effective. Different graph grammars have been proposed and applied in pattern recognition [Claus 79] and especially to describe technical dimensions: D. Dori has proposed a web grammar, Dori 88] Dori 92] In our case, this formalism would be another powerful approach, but the parsing step for a graph language is more difficult than parsing for a string language. However, plex grammars and ....

V. Claus, H. Ehrig and G. Rozenberg, editors. Graph-Grammars and Their Applications to Computer Science and Biology. Lecture Notes in Computer Science. SpringerVerlag, 1979.

....usually called term graph rewriting and has been studied extensively (see [97] for a representative collection of papers) However, graph rewriting is a very general model and can express many other computations besides functional ones. The theory of graph grammars and graph transformations (see [33, 94] for recent conferences) considers graph rewriting in this more general sense. Different mathematical axiomatizations of graph rewriting have been proposed in the literature. The categorical approach using double or single pushouts has been studied quite extensively [33, 94] However, for our ....

....transformations (see [33, 94] for recent conferences) considers graph rewriting in this more general sense. Different mathematical axiomatizations of graph rewriting have been proposed in the literature. The categorical approach using double or single pushouts has been studied quite extensively [33, 94]. However, for our purposes the most convenient axiomatizations are those in which labelled graphs are axiomatized equationally as an algebraic data type in such a way that graph rewriting becomes rewriting modulo the equations axiomatizing the type. Axiomatizations in this spirit include those of ....

H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph Grammars and their Application to Computer Science. Springer LNCS 532, 1991.

....proving properties of such graph generating tree grammars. 1 Introduction The most well known way of generating graphs is to replace a subgraph by another subgraph, analogous to string rewriting systems. The resulting theory of graph grammars has been developed since the seventies (see, e.g. [41, 20, 19, 32, 7]) Of particular interest are the context free graph grammars, in which the replaced subgraph is a single edge or node. Such grammars model graph properties that can be defined in a recursive way. A conceptually completely different way of generating graphs is to use symbolic computation, as ....

H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds.); Graph-Grammars and their Application to Computer Science, Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987

....proving properties of such graph generating tree grammars. 1 Introduction The most well known way of generating graphs is to replace a subgraph by another subgraph, analogous to string rewriting systems. The resulting theory of graph grammars has been developed since the seventies (see, e.g. [41, 20, 19, 32, 7]) Of particular interest are the context free graph grammars, in which the replaced subgraph is a single edge or node. Such grammars model graph properties that can be defined in a recursive way. A conceptually completely different way of generating graphs is to use symbolic computation, as ....

H.Ehrig, H.-J.Kreowski, G.Rozenberg (eds.); Graph-Grammars and their Application to Computer Science, Lecture Notes in Computer Science 532, Springer-Verlag, Berllin, 1991

.... structures, with a binary gluing operation and all possible quantifier free first order definable unary operations, is presented in [Cou5] For a recent survey on C edNCE see [ER2] Other surveys that discuss work on C edNCE and HR are [Cou8, DHK, Eng5, Eng6] For graph grammars in general see [Roz, ENRR, EKR, CEER]. 2 Preliminaries N = f0; 1; 2; g and for m;n 2 N, m; n] fm; ng. The domain of a function f is denoted dom(f ) 2.1 Graphs, trees, and strings The reader is assumed to be familiar with formal language theory (see, e.g. HU] in particular tree language theory (see, e.g. ....

H.Ehrig, M.Nagl, G.Rozenberg, A.Rosenfeld (eds.); Graph-Grammars and their Application to Computer Science, Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987

.... structures, with a binary gluing operation and all possible quantifier free first order definable unary operations, is presented in [Cou5] For a recent survey on C edNCE see [ER2] Other surveys that discuss work on C edNCE and HR are [Cou8, DHK, Eng5, Eng6] For graph grammars in general see [Roz, ENRR, EKR, CEER]. 2 Preliminaries N = f0; 1; 2; g and for m;n 2 N, m; n] fm; ng. The domain of a function f is denoted dom(f ) 2.1 Graphs, trees, and strings The reader is assumed to be familiar with formal language theory (see, e.g. HU] in particular tree language theory (see, e.g. ....

H.Ehrig, H.-J.Kreowski, G.Rozenberg (eds.); Graph Grammars and their Application to Computer Science, Lecture Notes in Computer Science 532, Springer-Verlag, Berlin, 1991

....by the formal structures made available by the notation. This idea is still present for example in DOMINO [24] where Petri nets algorithms are exploited [5] and in the proposal contained in [13] where a proof of correctness of a modification of ICN [14] exploits the theory of graph grammars [12] as ICN are based on AND OR Graphs. Define and modify can be implemented as a communication sent from the user interface to the current protocol, namely Curr Prot. perform(over write (suitable parameter ) 4) animate(X) and simulate(X) provide the user with the possibility of playing with ....

Ehrig, H., M. Nagl, and G. Rozenberg (eds.): GraphGrammars and Their Application to Computer Science (2nd International Workshop), Springer-Verlag, Berlin, 1983.

....different areas of computer science, such as symbolic computation and term rewriting systems, abstract data type specifications, functional programming languages and concurrency. The abstract concept of reduction affects different objects: terms [8] combinators and terms [6] proofs [11] graphs [5], polynomials [1] In [8] the concept of Abstract Reduction System is proposed, that, abstracting from the particular objects to which reduction apply, presents a unifying treatment of reduction, where some important concepts, such as confluence, noetherianity, normal form can be assessed. The ....

H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld. Graph grammars and their application to computer science. Springer-Verlag, L.N.C.S. 291, 1987.

....of graph grammar, motivated from the study of graph grammars, has been studied by many researchers, for example, Rosenfeld, Montanari, Courcelle, Schneider, Ehrig and Kreowski. Since then the idea to transform graphs with socalled double pushout derivations has been applied to various fields [3, 6, 7, 8] of computer science. In 1984 Raoult [16] proposed another idea for graph transformations, so called single pushout rewritings [13, 2] making use of a notion of partial morphisms of term graphs, and discussed about the Church Rosser property and critical pairs of production rules by a categorical ....

H. Ehrig, M. Nagl, G. Rozenberg and A. Rosenfeld (Eds.), Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 291(1987).

....of graph grammar, motivated from the study of graph grammars, has been studied by many researchers, for example, Rosenfeld, Montanari, Courcelle, Schneider, Ehrig and Kreowski. Since then the idea to transform graphs with socalled double pushout derivations has been applied to various fields [3, 6, 7, 8] of computer science. In 1984 Raoult [16] proposed another idea for graph transformations, so called single pushout rewritings [13, 2] making use of a notion of partial morphisms of term graphs, and discussed about the Church Rosser property and critical pairs of production rules by a categorical ....

H. Ehrig, H.-J. Kreowski and G. Rozenberg (Eds.), Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532(1991).

....of graph grammar, motivated from the study of graph grammars, has been studied by many researchers, for example, Rosenfeld, Montanari, Courcelle, Schneider, Ehrig and Kreowski. Since then the idea to transform graphs with socalled double pushout derivations has been applied to various fields [3, 6, 7, 8] of computer science. In 1984 Raoult [16] proposed another idea for graph transformations, so called single pushout rewritings [13, 2] making use of a notion of partial morphisms of term graphs, and discussed about the Church Rosser property and critical pairs of production rules by a categorical ....

H. Ehrig, H.-J. Kreowski and G. Rozenberg (Eds.), Graph-Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 153(1982).

....papers. All contributions are shortly described. Similarly to the COMPUGRAPH reports the annotated bibliography is structured according to the areas of COMPUGRAPH II. This annotated bibliography does not give an introduction to graph transformation. For this purpose the reader is referred to [CER79, ENRR87, EKR91, SE94] A previous bibliography of papers on graph grammars and graph transformation is given in [Nag80] This annotated bibliography is divided into three main chapters concerning foundations of graph transformation, concurrency concepts and graph transformation for specification ....

V. Claus, H. Ehrig, and G. Rozenberg(eds.). Graph grammars and their application to computer science and biology. In LNCS 79. Springer Verlag, 1979.

No context found.

V. Claus, H. Ehrig, and G. Rozenberg (Eds.), "Graph Grammars and Their Application to Computer Science and Biology, Selected Papers," Lecture Notes in Computer Science, Vol. 73, SpringerVerlag, New York/Berlin, 1979.

No context found.

Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors. Graph Grammars and Their Application to Computer Science and Biology, Selected Papers, volume 73 of Lecture Notes in Computer Science. Springer-Verlag, 1979.

No context found.

V. Claus, H. Ehrig, and G. Rozenberg, editors. Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science. Springer, 1979.

No context found.

V. Claus, H. Ehrig, and G. Rozenberg, editors. Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science. Springer, 1979.

No context found.

Ehrig, H., Nagl, M., Rozenberg, G., and Rosenfeld, A., editors (1987). Graph Grammars and Their Application to Computer Science, number 291 in Lect. Notes Comput. Sci.

No context found.

H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph-Grammars and Their Application to Computer Science, International Workshop, volume 532 of Lecture Notes in Computer Science, Berlin, 1990. Springer.

No context found.

Hartmut Ehrig, Hans-Jorg Kreowski, and Grzegorz Rozenberg, editors. Proc. Graph Grammars and Their Application to Computer Science, number 532 in Lecture Notes in Computer Science, 1991.

No context found.

Hartmut Ehrig, Hans-Jorg Kreowski, and Grzegorz Rozenberg, editors. Graph-Grammars and Their Application to Computer Science, 4th International Workshop, volume 532 of Lecture Notes in Computer Science, Bremen, Germany, March 1990. Springer-Verlag.

No context found.

Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors. Graph-Grammars and Their Application to Computer Science and Biology, International Workshop, volume 73 of Lecture Notes in Computer Science, Bad Honnef, November 1978. Springer-Verlag.

First 50 documents  Next 50

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