4. Graph Grammars: Bremen, Germany, 1990

@proceedings{DBLP:conf/gg/1990,
  editor    = {Hartmut Ehrig and
               Hans-J{\"o}rg Kreowski and
               Grzegorz Rozenberg},
  title     = {Graph-Grammars and Their Application to Computer Science, 4th
               International Workshop, Bremen, Germany, March 5-9, 1990, Proceedings},
  booktitle = {Graph-Grammars and Their Application to Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {532},
  year      = {1991},
  isbn      = {3-540-54478-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Part 1

• Frank Drewes, Hans-Jörg Kreowski: A Note on Hyperedge Replacement. 1-12
• Joost Engelfriet, Grzegorz Rozenberg: Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars. 12-23
• Hartmut Ehrig, Martin Korff, Michael Löwe: Tutorial Introduction to the Algebraic Approach of Graph Grammars Based on Double and Single Pushouts. 24-37
• Bruno Courcelle: The Logical Exprssion of Graph Properties (Abstract). 38-40

Part 2: Panel Discussion - The Use of Graph Grammars in Applications

• Martin J. M. de Boer: Graph Grammars as a Modelling Tool in Developmental Biology. 41-43
• Horst Bunke: Graph Grammars - a Useful Tool for Pattern Recognition? 43-46
• Janice E. Cuny: Graph Grammars as Tools in Applications Work? 46-47
• F. David Fracchia: Modelling of Biological Structures. 47-48
• Herbert Göttler: Usefulness of Graph Grammars in Applications. 48-49
• Simon M. Kaplan: Applying Graph Grammars to Software engineering. 49-51
• Hans-Jörg Kreowski: Applied Graph Transformation. 51-52
• Brian H. Mayoh: Graph Grammars for Knowledge Representation. 53
• Manfred Nagl: Graph Grammars which are Suitable for Applications. 54-56
• Azaria Paz: Usefulness and Visibility of Graph Grammars. 56
• M. Ronan Sleep: Applications of Graph Grammars and Directions for Research. 57-60

Part 3

• Michael Himsolt: GraphEd: An Interactive Tool For Developing Graph Grammars. 61-65
• Andy Schürr: Presentation of the IPSEN-Environment: An Integrated and Incremental Project Support ENvironment. 66
• Andy Schürr: Presentation of the PROGRESS-Editor: A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems. 67
• Egon Wanke: PLEXUS: Tools for Analyzing Graph Grammars. 68-69

Part 4

• Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese: An Algebraic Theory of Graph Reduction. 70-83
• Duane A. Bailey, Janice E. Cuny, Charles D. Fisher: Programming with Very Large Graphs. 84-97
• Klaus Barthelmann: Describing Göttler's Operational Graph Grammars with Pushouts. 98-112
• Michel Bauderon: General Solution to a System of Recursive Equations. 113-126
• Martin J. M. de Boer: Construction of Map OL-Systems for Developmental Sequences of Plant Cell Layers. 127-143
• Franz-Josef Brandenburg: Layout Graph Grammars: The Placement Approach. 144-156
• Franz-Josef Brandenburg, Michal Chytil: Cycle Chain Code Picture Languages. 157-173
• Horst Bunke, Thomas Glauser, T.-H. Tran: An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm. 174-189
• Didier Caucal: An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes. 190-206
• Tien Chi Chen: Graphic Equivalence and Computer Optimization. 207-220
• Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Michael Löwe: Graph Grammars and Logic Programming. 221-237
• Bruno Courcelle: Graphs as Relational Structures: An Algebraic an Logical Approach. 238-252
• Bruno Courcelle, Joost Engelfriet, Grzegorz Rozenberg: Context-free Handle-rewriting Hypergraph Grammars. 253-268
• Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski, Francesco Parisi-Presicce: From Graph Grammars to High Level Replacement Systems. 269-291
• Hartmut Ehrig, Francesco Parisi-Presicce: Algebraic Specification Grammars: A Junction between Module Specifications and Graph Grammars. 292-310
• Joost Engelfriet: A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees. 311-327
• Joost Engelfriet, Linda Heyker: The Term Generating Power of Context-Free Hypergraph Grammars. 328-243
• Gregor Engels: Elementary Actions on an Extended Entity-Relationship Database. 344-362
• F. David Fracchia, Przemyslaw Prusinkiewicz: Physically-Based Graphical Interpretation of Marker Cellwork L-Systems. 363-377
• John R. W. Glauert, Richard Kennaway, M. Ronan Sleep: Dactl: An Experimental Graph Rewriting Language. 378-395
• Herbert Göttler, Joachim Günther, Georg Nieskens: Use Graph Grammars to Design CAD-Systems! 396-410
• Annegret Habel, Hans-Jörg Kreowski: Collage Grammars. 411-429
• Lilia Hess, Brian H. Mayoh: The Four Musicians: Analogies and Expert Systems - A Graphic Approach. 430-445
• Dirk Janssens, Grzegorz Rozenberg: Structured Transformations and Computation Graphs for Actor Grammars. 446-460
• Eric Jeltsch, Hans-Jörg Kreowski: Grammatical Inference Based on Hyperedge Replacement. 461-474
• Simon M. Kaplan, Joseph P. Loyall, Steven K. Goering: Specifying Concurrent Languages and Systems with ???-Grammars. 475-489
• Richard Kennaway: Graph Rewriting in Some Categories of Partial Morphisms. 490-504
• Martin Korff: Application of Graph Grammars to Rule-Based Systems. 505-519
• Clemens Lautemann: Tree Automata, Tree Decomposition and Hyperedge Replacement. 520-537
• Ulrike Lichtblau: Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time. 538-548
• Igor Litovsky, Yves Métivier: Computing with Graph Relabelling Systems with Priorities. 549-563
• Jacqueline Lück, Hermann B. Lück: Double-wall Cellworks Systems for Plant Meristems. 564-581
• Andrea Maggiolo-Schettini, Józef Winkowski: Programmed Derivations of Relational Structures. 582-598
• Manfred Nagl, Andy Schürr: A Specification Environment for Graph Grammars. 599-609
• Azaria Paz: The Theory of Graphoids: A Survey. 610-621
• Detlef Plump: Graph-Reducible Term Rewriting Systems. 622-636
• Azriel Rosenfeld: A Note on Graph Decimation. 637-640
• Andy Schürr: PROGRESS: A VHL-Language Based on Graph Grammars. 641-659
• Gabriele Taentzer, Holger Schween: Movement of Objects in Configuration Spaces modelled by graph Grammars. 660-675
• Walter Vogler: Recognizing Edge Replacement Graph Languages in Cubic Time. 676-687

Part 5

• Hartmut Ehrig, Michael Löwe: Computing by Graph Transformation: Overall Aims and New Results. 688-703