Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Graph Grammars and Their Application to Computer Science

Graph Grammars 1990: Graph Grammars and Their Application to Computer Science pp 41–60Cite as

Panel discussion: The use of graph grammars in applications

  • Conference paper
  • First Online:

  • 211 Accesses

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

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. M.J.M. De Boer. Modelling and simulation of the development of cellular layers with map Lindenmayer systems. This volume.

    Google Scholar 

  3. F.D. Fracchia and P. Prusinkiewicz. Physically-based graphical interpretation of map L-systems and cellwork L-systems. This volume.

    Google Scholar 

  4. 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. 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. J. Lück and H.B. Lück. Double-wall cellwork systems for plant meristems. This volume.

    Google Scholar 

  7. 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. 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. 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. Bunke, T. Glauser, T.-H. Tran: An efficient implementation of graph grammars based on the RETE matching algorithm, in this volume.

    Google Scholar 

  4. Pfaltz: Web grammars and picture description. Comp. Graphics and Image Processing 1, 1972, 193–219.

    Google Scholar 

  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. M. Nagl: Graph Grammars: Theory, Applications, Implementation (in German), Wiesbaden: Vieweg (1979).

    Google Scholar 

  2. M. Nagl, A. Schürr: A Specification Environment for Graph Grammars, this volume.

    Google Scholar 

  3. A. Schürr: PROGRESS — A VHL-Language Based on Graph Grammars, this volume.

    Google Scholar 

  4. Th. Brandes: Formal Methods for Specifying Automatic Parallelization (in German), Doctoral Thesis, Heidelberg: Hüthig Verlag (1988).

    Google Scholar 

  5. M. Jackel: Formal Specification of Ada's Concurrent Constructs by Graph Grammars, Doctoral Thesis, University of Osnabrück (1986).

    Google Scholar 

References

  1. 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. 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, H., Löwe, M., eds., 1989, “Computing by Graph Transformation” Report no. 89/14, Technical University Berlin.

    Google Scholar 

  4. 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, K. and Papadopoulos, G.A., 1988, “Parallel implementations of declarative languages based on graph rewriting”, Proc. Alvey Technical Conference.

    Google Scholar 

  6. Hoffmann, B. and Plump, D., 1989, “Jungle Evaluation for Efficient Term Rewriting”, Lecture Notes in Computer Science, 343, Springer.

    Google Scholar 

  7. Kennaway, J.R., 1987, “On ‘On graph rewritings'”, Theor. Comp. Sci., 52, 37–58.

    Article  Google Scholar 

  8. Kennaway, J.R., 1987, “Graph rewriting in some categories of partial morphisms”, University of East Anglia Report 1990.

    Google Scholar 

  9. 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, S.L., 1987, “The Implementation of Functional Languages”, Prentice-Hall, London.

    Google Scholar 

  11. 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, J.C., 1984, “On graph rewritings”, Theor. Comp. Sci., 32, 1–24.

    Article  Google Scholar 

  13. 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, J., 1980, “Computation on graph-like expressions”, Theor. Comp. Sci., 10, 171–185.

    Article  Google Scholar 

  15. Watson, I., Sargeant, J., Watson, P. and Woods, V., 1987, “Flagship computational models and machine architecture”, ICL Technical Journal, 5, 555–594.

    Google Scholar 

Download references

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

(1991). Panel discussion: The use of graph grammars in applications. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017377

Download citation

  • DOI: https://doi.org/10.1007/BFb0017377

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation