S.H. von Solms. Node-label controlled graph grammars with context conditions. Intern. J. Computer Math. 15, 39--49, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Grammars with Negative Application Conditions - Habel, Heckel, Taentzer (1995) (32 citations) (Correct)
....and random context grammars, are intensively studied, up to now, there are only some investigations concerning regulated graph grammars. The only known papers in this direction are the ones on 1. graph grammars with application conditions (see Pfaltz, Rosenfeld [20] Montanari [19] von Solms [24] Ehrig, Habel [9] Kreowski [15] 11 For a non empty string w = a 1 : an , graph(w) denotes a graph of the form (fv 0 ; v 1 ; vng; fe 1 ; e ng ; s; t; c; d) with s(e i ) v i Gamma1 , t(e i ) v i , c(v i ) ffl, and d(e i ) a i for i = 1; n. For the empty ....
S.H. von Solms. Node-label controlled graph grammars with context conditions. Intern. J. Computer Math. 15, 39--49, 1984.
Embedding of Conditional Graph Transformations - Heckel (1995) (3 citations) (Correct)
....in the transformation have to satisfy certain conditions. These can be specified on the left and or right hand side of a rule and have to be checked at run time before the rule can be applied. Application conditions were used in several approaches to graph rewriting (see e.g. PR69] Mon70] [vS84]) while the most evolved wrt. to expressive power can certainly be found in PROGRES [Sch91] In the algebraic approach, application conditions have been introduced in [EH85] on a semantical level. In [HHT94] left sided positive and negative contextual conditions are developed in the framework of ....
S. H. von Solms, Node-label controlled graph grammars with context conditions, Intern. J. Computer Math 15 (1984), 39--49.
Performance Modeling Of VLSI Systems - Mandayam (1994) (3 citations) (Correct)
....Such relationships can range from the very simple (such as a set of nodes ) to the complex (such as a collection of nodes and edges that generates a bipartite graph ) 2. The production rules in graph grammars are more powerful than the rules allowed in string grammars. Context conditions ( [28] ) and embedding functions ( 29, 30] can be rigorously specified. 3. VLSI designs are intuitively modeled as a network of nodes and edges with nodes representing design objects and edges representing wires and nets. A graph is a natural representation for such models. Design objects can be ....
S. Solms, "Node-label controlled graph grammars with context conditions," Intern. J. Computer Math., vol. 15, pp. 39--49, 1984.
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