Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Graph Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155--166. Springer-Verlag, 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....; 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 string , graph( denotes the graph with one node and no edges. For a string language L, graph(L) denotes the set fgraph(w)jw 2 Lg. 2. programmed graph grammars (see Bunke [4], 5] 3. graph grammars with priorities (see Litovsky and M etivier [17] Nevertheless, a number of results can be adapted from formal language theory. In particular, it is not surprising that context free graph grammars with application conditions are more powerful than ordinary context free ....

....is of degree k. The question remains, under which conditions right sided application condition may be expressed by equivalent left sided ones. Graph grammars with application conditions provide one possibility to restrict the applicability of productions. Programmed graph grammars (see Bunke [4], 5] and graph grammars with priorities (see Litovsky and M etivier [17] provide other possibilities. In the first case, an application of a production may determine which productions are applicable at the next step; in the second case, a finite set of graph productions is equipped with a ....

Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, G. Rozenberg, eds., Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, 155--166, 1979.

.... that additional marker nodes guarantee certain sequences of graph transformation steps (applications of productions) This was the main reason for introducing so called programmed graph grammars many years ago, where imperative control structures enforce certain orders of production applications [6]. This approach leads to more readable and better maintainable specifications. PROGRES goes one step further on in the following sense: It does not only offer imperative deterministic control structures for programming complex graph transformations, but allows one to construct them using a ....

Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155--166, 1979.

....can be applied to various parts of a graph. Hence, in order to program or specify with graph transformation, it is often desirable to regulate the graph transformation process, for example by choosing rules according to a priority, or by prescribing a certain sequence of steps (cf. e.g. Sch75, Bun79, Nag79, MW96, Sch97, TER99] see also [DP89] for regulation concepts in string transformation) The concept of transformation units is generic in the sense that each formalism which specifies a binary relation on graphs can be used as a control condition. In order to use transformation units for ....

Horst Bunke. Programmed graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155--166, 1979.

.... that additional marker nodes guarantee certain sequences of graph transformation steps (applications of productions) This was the main reason for introducing so called programmed graph grammars many years ago, where imperative control structures enforce certain orders of production applications [44]. This approach leads to more readable and better maintainable specifications. PROGRES goes one step further on in the following sense: It does not only offer imperative deterministic control structures for programming complex graph transformations, but allows one to construct them using a ....

H. Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155--166, 1979.

....to be applied, 2. by determining the next rule in dependence on the previous one(s) or 3. by applying a rule according to its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch97] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 4 4 In Section 4, we introduce the notion of a transformation unit that encapsulates the four discussed components of graph transformation systems, i.e. a set of rules, ....

....in the graph which can be manipulated by a rule application. To regulate the graph transformation process, for example by choosing rules according to a priority, or by prescribing a certain sequence of steps, suitable control conditions are needed. Such conditions are treated, for example, in [Bun79, Sch91a, SZ91, MW96] cf. also [DP89] for regulation concepts in string grammars and [PvE93] for evaluation strategies in functional programming) With transformation units the graph transformation process can be regulated by using control conditions. Approach independence. The mentioned ....

Horst Bunke. Programmed graph grammars. In Claus et al. [CER79], 155-- 166.

....sequence of rules in a derivation, determining the next rule by the previous one(s) or choosing the rule in dependence of its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch95] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 2.4 Properties of Graph Transformation In the following, different properties of graph transformation are discussed which are of interest if graph transformation is considered as a ....

....3 that are directly included in the graph transformation rules. On the other hand, control conditions that regulate the derivation process independently from the employed transformation rules serve this purpose (cf. also Section 3.2. 2) Application and control conditions are treated in e.g. Bun79, EH86, KR90, Sch91a, SZ91, Kre93, HHT95b] cf. also [DP89] for regulation concepts in string grammars) Approach independence. The just mentioned components, i.e. classes of graphs, rules, and control structures are the basic components of so called graph transfomation approaches. In order to be ....

Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, G. Rozenberg, eds., Graph-Grammars and Their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, 155--166, 1979.

....to be applied, 2. by determining the next rule in dependence on the previous one(s) or 3. by applying a rule according to its priority. Prototypes of such transformation systems are matrix systems as considered in formal language theory, programmed graph transformation systems (see e.g. Bunke [Bun79, Bun82] and Schurr [Sch96] and graph transformation systems with priorities (see Litovsky and M etivier [LM93] 4 2.4 Properties of Graph Transformation In the following, properties of graph transformation are discussed which are of interest if graph transformation is considered as a ....

....as many rules may be applicable to many occurrences in a graph. To regulate the graph transformation process, for example by choosing rules according to a priority, or by prescribing a certain sequence of steps, suitable control conditions are needed. Such conditions are treated, for example, in [Bun79, Sch91a, SZ91, MW96] cf. also [DP89] for regulation concepts in string grammars and [PvE93] for evaluation strategies in functional programming) In Grace the graph transformation process can be regulated by using control conditions. Approach independence. Classes of graphs, rules, graph class ....

Horst Bunke. Programmed graph grammars. In Claus et al. [CER79], 155-- 166.

....which can be manipulated by a rule application. In order to program or specify with graph transformation it may be often desirable to regulate the graph transformation process, for example by choosing rules according to a priority, or by prescribing a certain sequence of steps (cf. e.g. Sch75, Bun79, Nag79, MW96, Sch97] see also [DP89] for regulation concepts in string transformation) Moreover, real applications of graph transformation may often consist of hundreds of rules which can only be managed in a reasonable and transparent way with a structuring principle. Therefore, several ....

Horst Bunke. Programmed graph grammars. In Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science, pages 155--166, 1979.

....objects only. Or if a more functional behaviour is required, one may prefer to control the derivation process and to cut down its non determinism. The latter can be achieved by control mechanisms for the derivation process like application conditions or programmed graph transformation (see, e.g. [17 27], cf. also [28] for regulation concepts in string grammars) and the former by the use of graph class expressions that specify subclasses of graphs. Moreover, in practical cases, one may have to handle hundreds or thousands of rules which cannot be done in a transparent and reasonable way without a ....

Horst Bunke. Programmed graph grammars. In Claus et al. [1], pages 155--166.

....objects only. Or if a more functional behaviour is required, one may prefer to control the derivation process and to cut down its non determinism. The latter can be achieved by control mechanisms for the derivation process like application conditions or programmed graph transformation (see, e.g. Bun79, Nag79, EH86, KR90, MW91, Sch91a, SZ91, Kre93, LM93, HHT96, MW96] cf. also [DP89] for regulation concepts in string grammars) and the former by the use of graph class expressions that specify subclasses of graphs. Moreover, in practical cases, one may have to handle hundreds or thousands of ....

Horst Bunke. Programmed graph grammars. In Claus et al. [CER79], 155--166.

....objects only. Or if a more functional behaviour is required, one may prefer to control the derivation process and to cut down its non determinism. The latter can be achieved by control mechanisms for the derivation process like application conditions or programmed graph transformation (see, e.g. [Bun79, Nag79, EH86, KR90, MW91, Sch91a, SZ91, Kre93, LM93, HHT95], cf. also [DP89] for regulation concepts in string grammars) and the former by the use of graph class expressions that specify subclasses of graphs. Moreover, in practical cases, one may have to handle hundreds or thousands of rules which cannot be done in a transparent and reasonable way without ....

H. Bunke. Programmed graph grammars. In Claus et al. [CER79], 155-- 166.

No context found.

Horst Bunke. Programmed graph grammars. In V. Claus, H. Ehrig, and G. Rozenberg, editors, Graph Grammars and Their Application to Computer Science and Biology, volume 73 of Lecture Notes in Computer Science, pages 155--166. Springer-Verlag, 1979.

No context found.

Bunke, H.: Programmed graph grammars. In Claus, V., Ehrig, H., Rozenberg, G., eds.: Graph Grammars and Their Application to Computer Science and Biology. Volume 73 of Lecture Notes in Computer Science., Springer-Verlag (1979) 155--166

No context found.

Bunke, H., Programmed Graph Grammars, in [CER 79], pp.155-166

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