Graph grammars and their application to computer science. 5th international workshop, Williamsburg, VA, USA, November 13--18, 1994. Selected papers (Q1919223)

The articles of this volume will be reviewed individually. The 4th workshop (1990) has been reviewed (see Zbl 0753.00023). Indexed articles: \textit{Alberich, R.; Burmeister, P.; Rosselló, F.; Valiente, G.; Wojdyło, B.}, A partial algebras approach to graph transformation, 1-15 [Zbl 1412.68095] \textit{Banach, R.}, The contractum in algebraic graph rewriting, 16-26 [Zbl 1412.68097] \textit{Bauderon, Michel}, A category-theoretical approach to vertex replacement: the generation of infinite graphs, 27-37 [Zbl 1412.68098] \textit{Corradini, A.; Ehrig, H.; Löwe, M.; Montanari, U.; Padberg, J.}, The category of typed graph grammars and its adjunctions with categories of derivations, 56-74 [Zbl 1412.68099] \textit{Plump, Detlef; Habel, Annegret}, Graph unification and matching, 75-88 [Zbl 1412.68115] \textit{Kreowski, Hans-Jörg; Kuske, Sabine}, On the interleaving semantics of transformation units -- a step into GRACE, 89-106 [Zbl 1412.68109] \textit{Maggiolo-Schettini, Andrea; Peron, Adriano}, A graph rewriting framework for Statecharts semantics, 107-121 [Zbl 1412.68111] \textit{Schürr, Andy}, Programmed graph transformations and graph transformation units in GRACE, 122-136 [Zbl 1412.68118] \textit{Ehrig, Hartmut; Engels, Gregor}, Pragmatic and semantic aspects of a module concept for graph transformation systems, 137-154 [Zbl 1412.68105] \textit{Nagl, Manfred; Schürr, Andy}, Software integration problems and coupling of graph grammar specifications, 155-169 [Zbl 1412.68140] \textit{Wills, Linda Mary}, Using attributed flow graph parsing to recognize clichés in programs, 170-184 [Zbl 1412.68045] \textit{Derk, M. D.; DeBrunner, L. S.}, Reconfiguration graph grammar for massively parallel, fault tolerant computers, 185-195 [Zbl 1412.68023] \textit{Drewes, Frank}, The use of tree transducers to compute translations between graph algebras, 196-210 [Zbl 1412.68126] \textit{Skodinis, K.; Wanke, E.}, The bounded degree problem for non-obstructing eNCE graph grammars, 211-224 [Zbl 1412.68119] \textit{Barthelmann, Klaus}, Process specification and verification, 225-239 [Zbl 1412.68137] \textit{Corradini, A.; Ehrig, H.; Löwe, M.; Montanari, U.; Rossi, F.}, An event structure semantics for graph grammars with parallel productions, 240-256 [Zbl 1412.68100] \textit{Corradini, Andrea; Rossi, Francesca}, Synchronized composition of graph grammar productions, 257-270 [Zbl 1412.68101] \textit{Janssens, D.}, The decomposition of ESM computations, 271-287 [Zbl 1412.68152] \textit{Korff, Martin; Ribeiro, Leila}, Formal relationship between graph grammars and Petri nets, 288-303 [Zbl 1412.68108] \textit{Taentzer, Gabriele}, Hierarchically distributed graph transformation, 304-320 [Zbl 1412.68120] \textit{Aßmann, Uwe}, On edge addition rewrite systems and their relevance to program analysis, 321-335 [Zbl 1412.68096] \textit{Brandenburg, F. J.; Skodinis, K.}, Graph automata for linear graph languages, 336-350 [Zbl 1412.68123] \textit{Courcelle, B.; Sénizergues, G.}, The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed, 351-367 [Zbl 1412.68102] \textit{Engelfriet, Joost; Vereijken, Jan Joris}, Concatenation of graphs, 368-382 [Zbl 1412.68128] \textit{Kim, Changwook; Jeong, Tae Eui}, HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting, 383-396 [Zbl 1412.68106] \textit{Klempien-Hinrichs, Renate}, Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence, 397-411 [Zbl 1412.68107] \textit{Dassow, Jürgen; Habel, Annegret; Taubenberger, Stefan}, Chain-code pictures and collages generated by hyperedge replacement, 412-427 [Zbl 1412.68103] \textit{Parisi-Presicce, Francesco}, Transformations of graph grammars, 428-442 [Zbl 1412.68113] \textit{Zinßmeister, Gaby; McCreary, Carolyn L.}, Drawing graphs with attribute graph grammars, 443-453 [Zbl 1412.68175] \textit{Arnborg, Stefan; Proskurowski, Andrzej}, A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths, 469-486 [Zbl 1412.68161] \textit{Courcelle, Bruno}, The definition in monadic second-order logic of modular decompositions of ordered graphs, 487-501 [Zbl 1412.68167] \textit{Ehrenfeucht, A.; Harju, T.; Rozenberg, G.}, Group based graph transformations and hierarchical representations of graphs, 502-520 [Zbl 1412.68104] \textit{Fracchia, F. David}, Integrating lineage and interaction for the visualization of cellular structures, 521-535 [Zbl 1412.68146] \textit{Lück, Jacqueline; Lück, Hermann B.}, Cellworks with cell rewriting and cell packing for plant morphogenesis, 536-549 [Zbl 1412.68110] \textit{Prusinkiewicz, Przemyslaw; Kari, Lila}, Subapical bracketed L-systems, 550-564 [Zbl 1412.68116]