Renate Klempien-Hinrichs. Normal forms for context-free node-rewriting hypergraph grammars. Mathematical Structures in Computer Science, 12:135-148, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Appligraph: Applications of Graph Transformation - Fifth.. - Kreowski, (eds.) (2002) (Correct)
....by speci ed and validated using the language and the tools of the semantic domain. In [HK01, EHK01] this general methodology is introduced and exempli ed by the problem of protocol statechart inheritance while [EKGH01] applies the approach to consistency issues of UML RT. Update: The papers [Kle02b] and [HMP01] have now appeared, the latter was described in the Third Progress Report. 3.1.4 Language Design With PROGRES, two successful principles are combined in one formalism: rules and graphs. This is the common vision of the graph transformation community and the main motivation behind ....
Renate Klempien-Hinrichs. Normal forms for context-free noderewriting hypergraph grammars. Mathematical Structures in Computer Science, 12:135-148, 2002.
Appligraph: Applications of Graph Transformation - Fourth.. - Kreowski, (eds.) (2001) (Correct)
....is extended to contextual nets by considering monoidal categories of computations over a non free monoid of places: a token is regarded as an atom that can emit several negative particles that can be read (but not consumed) separately. 4.1. 3 Semantics, Correctness and Optimisation The paper [Kle01], which was already described in the Third Annual Report, has been accepted for publication in Mathematical Structures in Computer Science. The paper [KV00] is described in the 2nd Annual Report. It is common (e.g. in the meta model of UML) to use graphs for represent8 ing the abstract syntax of ....
Renate Klempien-Hinrichs. Normal forms for contextfree node-rewriting hypergraph grammars. Mathematical Structures in Computer Science,
Appligraph: Applications of Graph Transformation - Third.. - Kreowski, (eds.) (2000) (Correct)
....grammars, which form a large natural subclass of C hNCE grammars, includes properly that of HR and S HH grammars together. This indicates that con uent node rewriting plays as important a role in generating sets of hypergraphs as it does in generating sets of graphs. Moreover, it is shown in [Kle00b] that for remote free C hNCE grammars, the maximal rank of hyperedges indispensable to generate some set of hypergraphs equals the maximal rank of the hyperedges occurring in the hypergraphs of that set. This implies that if such a C hNCE grammar generates a set of graphs, then it has a C edNCE ....
Renate Klempien-Hinrichs. Normal forms for context-free noderewriting hypergraph grammars. In Ehrig and Taentzer [ET00]. 46
Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
No context found.
Renate Klempien-Hinrichs. Normal forms for context-free node-rewriting hypergraph grammars. Mathematical Structures in Computer Science, 12:135-148, 2002.
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