Advertisement

Panel discussion: The use of graph grammars in applications

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 532)

Keywords

Graph Transformation Unknown Input Graph Grammar Pattern Recognition System Parallel Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1a]
    M.J.M. De Boer and A. Lindenmayer. 1987. Map OL-systems with edge label control: Comparison of marker and cyclic systems. Pages 378–392 in H. Ehrig, M. Nagl, G. Rozenberg and A. Rosenfeld, eds. Graph Grammars and their Application to Computer Science. Lecture Notes in Computer Science 291. Springer-Verlag, Berlin.Google Scholar
  2. [1b]
    M.J.M. De Boer. Modelling and simulation of the development of cellular layers with map Lindenmayer systems. This volume.Google Scholar
  3. [1c]
    F.D. Fracchia and P. Prusinkiewicz. Physically-based graphical interpretation of map L-systems and cellwork L-systems. This volume.Google Scholar
  4. [1d]
    A. Lindenmayer. 1984. Models for plant tissue development with cell division orientation regulated by preprophase bands of microtubules. Differentiation 26: 1–10.Google Scholar
  5. [1e]
    H.B. Lück and J. Lück. 1986. Unconventional leaves. (An application of map OL-systems to biology). Pages 275–289 in G. Rozenberg and A. Salomaa, eds. The Book of L. Springer-Verlag, Berlin.Google Scholar
  6. [1f]
    J. Lück and H.B. Lück. Double-wall cellwork systems for plant meristems. This volume.Google Scholar
  7. [1g]
    A. Nakamura, A. Lindenmayer and K. Aizawa. 1986. Some systems for map generation. Pages 323–332 in G. Rozenberg and A. Salomaa, eds. The Book of L. Springer-Verlag, Berlin.Google Scholar

References

  1. [1]
    H. Bunke: Hybrid pattern recognitions methods: In: H. Bunke, A. Sanfeliu (eds.:) Syntactic and structural pattern recognition — theory and applications, World Scientific Publ. Co., Singapore, 1990, 307–347.Google Scholar
  2. [2]
    H. Bunke: Graph grammars as a generative tool in image understanding In: H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.:) Graph-grammars and their application to computer science, Springer Lecture Notes 153, 1983, 8–19.Google Scholar
  3. [3]
    Bunke, T. Glauser, T.-H. Tran: An efficient implementation of graph grammars based on the RETE matching algorithm, in this volume.Google Scholar
  4. [4]
    Pfaltz: Web grammars and picture description. Comp. Graphics and Image Processing 1, 1972, 193–219.Google Scholar
  5. [5]
    M. Brayer: Web grammars and their application to pattern recognition. Technical Report TR-EE 75-1, Purdue University, West Lafayette/IN, 1975.Google Scholar

References

  1. [Na 79]
    M. Nagl: Graph Grammars: Theory, Applications, Implementation (in German), Wiesbaden: Vieweg (1979).Google Scholar
  2. [NS 90]
    M. Nagl, A. Schürr: A Specification Environment for Graph Grammars, this volume.Google Scholar
  3. [Sc 90]
    A. Schürr: PROGRESS — A VHL-Language Based on Graph Grammars, this volume.Google Scholar
  4. [Br 88]
    Th. Brandes: Formal Methods for Specifying Automatic Parallelization (in German), Doctoral Thesis, Heidelberg: Hüthig Verlag (1988).Google Scholar
  5. [Ja 86]
    M. Jackel: Formal Specification of Ada's Concurrent Constructs by Graph Grammars, Doctoral Thesis, University of Osnabrück (1986).Google Scholar

References

  1. [Bar 87]
    Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J., and Sleep, M.R., 1987, “Term graph rewriting”, Proc. PARLE conference, Lecture Notes in Computer Science, 259, 141–158, Springer.Google Scholar
  2. [Bar 89]
    Barendregt, H.P., van Eekelen, M.C.J.D., Glauert, J.R.W., Kennaway, J.R., Plasmeijer, M.J. and Sleep, M.R., 1989, “LEAN an Intermediate Language based on Graph Rewriting”. Journal of Parallel Computing 9, North Holland.Google Scholar
  3. [Ehrig 89]
    Ehrig, H., Löwe, M., eds., 1989, “Computing by Graph Transformation” Report no. 89/14, Technical University Berlin.Google Scholar
  4. [Glauert 88]
    Glauert, J.R.W., Kennaway, J.R. and Sleep, M.R., 1988, “Final Specification of Dactl”, University of East Anglia report SYS-C88-11.Google Scholar
  5. [Hammond 88]
    Hammond, K. and Papadopoulos, G.A., 1988, “Parallel implementations of declarative languages based on graph rewriting”, Proc. Alvey Technical Conference.Google Scholar
  6. [Hoffmann 89]
    Hoffmann, B. and Plump, D., 1989, “Jungle Evaluation for Efficient Term Rewriting”, Lecture Notes in Computer Science, 343, Springer.Google Scholar
  7. [Kennaway 87]
    Kennaway, J.R., 1987, “On ‘On graph rewritings'”, Theor. Comp. Sci., 52, 37–58.CrossRefGoogle Scholar
  8. [Kennaway 90]
    Kennaway, J.R., 1987, “Graph rewriting in some categories of partial morphisms”, University of East Anglia Report 1990.Google Scholar
  9. [Klop 90]
    Klop, J.W., 1990, “Term rewriting systems”, Handbook of Logic in Computer Science eds., Abramsky S., Gabbay D. and Maibaum T., Oxfort University Press.Google Scholar
  10. [Peyton Jones 87a]
    Peyton Jones, S.L., 1987, “The Implementation of Functional Languages”, Prentice-Hall, London.Google Scholar
  11. [Peyton Jones 87b]
    Peyton Jones, S.L., Clack, C.D. and Salkild, J., 1987, “GRIP: a parallel graph reduction machine”, ICL Technical Journal, 5, 595–599.Google Scholar
  12. [Raoult 84]
    Raoult, J.C., 1984, “On graph rewritings”, Theor. Comp. Sci., 32, 1–24.CrossRefGoogle Scholar
  13. [Sleep 89]
    Sleep, M.R., 1989, “The semantics and pragmatics of generalized graph rewriting”, (SemaGraph) ESPRIT Basic Research Action 3074 Invited paper, EATCS Bulletin No. 39 Oct. 1989.Google Scholar
  14. [Staples 80]
    Staples, J., 1980, “Computation on graph-like expressions”, Theor. Comp. Sci., 10, 171–185.CrossRefGoogle Scholar
  15. [Watson 87]
    Watson, I., Sargeant, J., Watson, P. and Woods, V., 1987, “Flagship computational models and machine architecture”, ICL Technical Journal, 5, 555–594.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Personalised recommendations