H.-J. Kreowski, G. Rozenberg, "On Structured Graph Grammars, I, II" Information Sciences, Vol. 52, 1990, pp. 185-210, 210-246. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Grammar Based Object Recognition for Image Retrieval - Klauck (1995) (1 citation) (Correct)
....this thesaurus. 3. 1 1 NRCF Graph Grammars and GraPaKL In the following, we define the terminology of neighborhood controlled node labeled and node attributed feature graph grammars (1 NRCFGG) as specified in [9] Surveys and detailed introduction to graph grammars can be found e.g. in [10] [11]. In our paper the term feature graph represents a finite undirected node attributed and node labeled graph, in the sequel shortly called graph. The interpretation of the edges in our graph s is restricted to a kind of topological neighborhoodness (nr) i.e. a kind of nr inheritance is ....
H.-J. Kreowski and G. Rozenberg, "On Structured Graph Grammars. II", Information Sciences, vol. 52, pp. 221--246, 1990.
Performance Modeling Of VLSI Systems - Mandayam (1994) (3 citations) (Correct)
....used in scene analysis, picture processing etc. but their use in software environments (such as CAD tools) has been limited. Researchers have identified and analyzed different subsets of graph grammars in order to better understand them and develop a rigorous, formal model. Kreowski and Rozenberg [7, 8] survey different classes of graph grammars and formalize a variety of issues. Context free graph grammars (CFGGs) were originally described by Pavlidis [9] in the context of picture processing and pattern recognition applications. The author develops a theory of m th order CFGGs (for m 1) ....
H. Kreowski and G. Rozenberg, "On structured graph grammars. II," Information Sciences, vol. 52, pp. 185--210, 1990.
Practical Use of Graph Rewriting - Dorothea Blostein, Hoda Fahmy, Ann.. (1995) (7 citations) (Correct)
....a decision on how to attach the new subgraph to the host graph. This can be done via an explicit embedding specification or implicitly by a gluing isomorphism. Kreowski and Rozenberg combine these two approaches in their definition of a structured graph rewriting rule; their presentation [KrRo90a] [KrRo90b] is recommended as a formal introduction to the embedding and gluing approaches to graph rewriting. Before reviewing these approaches, we must establish terminology, since varied terms are used in the literature. 1.1 Terminology Terminology for graph rewriting is not standardized; we use the ....
....with label A. b) A hypergraph; the solid nodes are sockets joining hyperedges. A. 6 Structured Graph Rewriting: Embedding combined with Gluing The structured graph rewriting model of Kreowski and Rozenberg unites a wide variety of graph rewriting approaches under one general framework [KrRo90a] [KrRo90b]. A complex model results from this effort to accommodate both the embedding and the gluing approaches to graph rewriting. While this model may be too complex for practical use, it provides an excellent overview of graph rewriting mechanisms. Existing approaches to graph rewriting are modeled ....
H.-J. Kreowski, G. Rozenberg, "On Structured Graph Grammars, II," Information Sciences, Vol. 52, 1990, pp. 221-246.
Formal Business Process Engineering Based on Graph Grammars - Klauck, Müller (1996) (4 citations) (Correct)
....H. J. Kreowski and G. Rozenberg [3] According to requirements coming up from the application to business process (re )engineering this formalism has been extended with some features, like attributes and semantical relations. Surveys and detailed introduction to graph grammars can be found e.g. in [3, 5, 6, 7]. 3.1 Business processes Definition 3.1 Let Sigma E ; Sigma R be two finite sets of labels. 1. A tupel BP = E; R; s; t; kE ; kR ) is a business process, with ffl E 6= is a finite set of process entities, ffl R E Theta E is a finite set of process relations, ffl s; t : R E are direction ....
H.-J. Kreowski and G. Rozenberg, "On Structured Graph Grammars. II", Information Sciences, vol. 52, pp. 221--246, 1990.
Issues in the Practical Use of Graph Rewriting - Blostein, Fahmy, Grbavec (1996) (8 citations) (Correct)
No context found.
H.-J. Kreowski, G. Rozenberg, "On Structured Graph Grammars, I, II" Information Sciences, Vol. 52, 1990, pp. 185-210, 210-246.
Towards an Integration of Software-Ergonomic Aspects in Formal.. - Sucrow (1996) (Correct)
No context found.
Kreoswki, H.-J. and Rozenberg, G, 1990B, "On structured Graph Grammars II", Journal of Information Sciences, Vol. 52, pp. 211-246.
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