## Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld

*Proceedings of the Third International Workshop on Graph-Grammars and Their Application to Computer Science*

GG, 1986.

@proceedings{GG-1986, address = "Warrenton, Virginia, USA", editor = "Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld", isbn = "3-540-18771-5", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the Third International Workshop on Graph-Grammars and Their Application to Computer Science}", volume = 291, year = 1986, }

### Contents (39 items)

- GG-1986-Ehrig #algebra #approach #graph grammar #tutorial
- Tutorial introduction to the algebraic approach of graph grammars (HE), pp. 3–14.
- GG-1986-HabelK
- May we introduce to you: hyperedge replacement (AH, HJK), pp. 15–26.
- GG-1986-Lindenmayer #generative #parallel
- An introduction to parallel map generating systems (AL), pp. 27–40.
- GG-1986-Nagl #graph grammar #set
- Set theoretic approaches to graph grammars (MN), pp. 41–54.
- GG-1986-Rozenberg #graph
- An introduction to the NLC way of rewriting graphs (GR), pp. 55–66.
- GG-1986-Rosenfeld #array
- Array Grammars (AR), pp. 67–70.
- GG-1986-BaileyC #grammarware #graph grammar #parallel #specification
- Graph Grammar Based Specification of Interconnection Structures for Massively Parallel Computation (DAB, JEC), pp. 73–85.
- GG-1986-BoehmEHL #distributed #graph grammar #towards
- Towards distributed graph grammars (PB, HE, UH, ML), pp. 86–98.
- GG-1986-Brandenburg #graph grammar #on the #order
- On Partially Ordered Graph Grammars (FJB), pp. 99–111.
- GG-1986-Courcelle #algebra #graph #graph grammar #representation #term rewriting
- A representation of graphs by algebraic expressions and its use for graph rewriting systems (BC), pp. 112–132.
- GG-1986-Courcelle86a #graph #higher-order #monad #on the #set
- On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
- GG-1986-AalbersbergER #complexity #strict
- Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.
- GG-1986-EngelfrietLR #graph grammar
- Apex Graph Grammars (JE, GL, GR), pp. 167–185.
- GG-1986-EngelsLS #grammarware #graph grammar #specification
- Graph Grammar Engineering: A Software Specification Method (GE, CL, WS), pp. 186–201.
- GG-1986-Fitzhorn #modelling
- A Linguistic Formalism for Engineering Solid Modeling (PF), pp. 202–215.
- GG-1986-Gottler #diagrams #editing #graph grammar
- Graph grammars and diagram editing (HG), pp. 216–231.
- GG-1986-HessM
- Graphics and Their Grammars (LH, BHM), pp. 232–249.
- GG-1986-HotzKM #algebra #equation #network #on the #recursion
- On Network Algebras and Recursive Equations (GH, RK, PM), pp. 250–261.
- GG-1986-Jackel #graph grammar
- ADA-Concurrency specified by Graph Grammars (MJ), pp. 262–279.
- GG-1986-JanssensR #graph grammar
- Basic notions of actor grammars: A graph grammar model for actor computation (DJ, GR), pp. 280–298.
- GG-1986-Jeffs #graph grammar #independence
- Embedding Rule Independent Theory of Graph Grammars (JJ), pp. 299–308.
- GG-1986-KaplanGC #development #graph grammar #process
- Supporting the Software Development Process with Attributed NLC Graph Grammars (SMK, SKG, RHC), pp. 309–325.
- GG-1986-Kaul #graph grammar #precedence
- Practical Applications of Precedence Graph Grammars (MK), pp. 326–342.
- GG-1986-Kreowski #concurrent #graph grammar #parallel
- Is parallelism already concurrency? Part 1: Derivations in graph grammars (HJK), pp. 343–360.
- GG-1986-KreowskiW #concurrent #graph grammar #parallel #process
- Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars (HJK, AW), pp. 361–377.
- GG-1986-BoerL #comparison
- Map OL-systems with edge label control: Comparison of marker and cyclic systems (MJMdB, AL), pp. 378–392.
- GG-1986-LuckL
- From OL and IL map systems to indeterminate and determinate growth in plant morphogenesis (JL, HBL), pp. 393–410.
- GG-1986-MainR #graph grammar
- Fundamentals of edge-label controlled graph grammars (MGM, GR), pp. 411–426.
- GG-1986-MoldovanP #analysis #graph grammar #parallel #rule-based #using
- Parallelism analysis in rule-based systems using graph grammars (DIM, FPP), pp. 427–439.
- GG-1986-MontanariR #algorithm #constraints #network #performance
- An Efficient Algorithm for the Solution of Hierarchical Networks of Constraints (UM, FR), pp. 440–457.
- GG-1986-Nagl86a #development #graph
- A Software Development Environment based on Graph Technology (MN), pp. 458–478.
- GG-1986-NakamuraLA
- Map OL systems with markers (AN, AL, KA), pp. 479–495.
- GG-1986-Parisi-PresicceEM #composition #graph grammar #unification
- Graph rewriting with unification and composition (FPP, HE, UM), pp. 496–514.
- GG-1986-CarlyleGP #complexity #generative #parallel
- Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.
- GG-1986-Prusinkiewicz
- Applications of L-systems to computer imagery (PP), pp. 534–548.
- GG-1986-Siromoney #array #roadmap
- Advances in array languages (RS), pp. 549–563.
- GG-1986-SiromoneyS
- Rosenfeld’s cycle grammars and kolam (GS, RS), pp. 564–579.
- GG-1986-Wankmuller #graph grammar #music
- Application of Graph Grammars in Music Composing Systems (FW), pp. 580–592.
- GG-1986-Welzl #bound #graph grammar
- Boundary NlC and partition controlled graph grammars (EW), pp. 593–609.

21 ×#graph grammar

6 ×#parallel

4 ×#graph

3 ×#algebra

3 ×#on the

2 ×#array

2 ×#complexity

2 ×#concurrent

2 ×#development

2 ×#generative

6 ×#parallel

4 ×#graph

3 ×#algebra

3 ×#on the

2 ×#array

2 ×#complexity

2 ×#concurrent

2 ×#development

2 ×#generative