Skip to main content
SpringerLink
Log in

A PrT-net representation of graph grammars

  • Graph-Grammars And Graph-Languages
  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1987)

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

Included in the following conference series:

Abstract

Formal methods to represent graph grammars using PrT-nets are studied. A transformation procedure from a graph production to a PrT-subnet is given. Moreover, a method to generate a PrT-net that accurately simulates a sequential graph grammar is described.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Ehrig. Introduction to the Algebraic Theory of Graph Grammars (A Survey), Proceedings of International Workshop on Graph Grammars and Their Application to Computer Science and Biology, Bad Honnef, Germany October 30–November 3, 1978, pp. 1–69. Springer-Verlag, Berlin. 1979.

    Google Scholar 

  2. H. Ehrig. Aspects of Concurrency in Graph Grammars, Proceedings of 2nd International Workshop on Graph Grammars and Their Application to Computer Science, Haus Ohrbeck, Germany October 4–8, 1982, pp. 58–81. Springer-Verlag, Berlin. 1983.

    Google Scholar 

  3. H. Genrich. Predicate/Transition Nets. Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part I, Proceedings of an Advanced Course, Bad Honnef, Germany, September 1986, pp. 207–247. Springer-Verlag, Berlin. 1987.

    Google Scholar 

  4. E. Montonen, L. Ojala, and T. Tuuliniemi. Net Representation for Take-Grant Protection Model, Proceedings of the WG'85, Graphtheoretic Concepts in Computer Science, Castle Schwanberg, Würzburg, Germany, June 18–21, 1985, pp. 267–279. Trauner Verlag, Linz. 1985.

    Google Scholar 

  5. E. Montonen, L. Ojala, and T. Tuuliniemi. A PrT-net Representation of Graph Grammars, Series A: Research reports No. 3, Digital Systems Laboratory, Helsinki University of Technology. 1987.

    Google Scholar 

  6. W. Reisig. Petri Nets, an Introduction, Springer-Verlag, Berlin. 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Digital Systems Laboratory, Helsinki University of Technology, Otakaari 5 A, SF-02150, Espoo, Finland

    Esa Montonen, Leo Ojala & Timo Tuuliniemi

Authors
  1. Esa Montonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leo Ojala
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Timo Tuuliniemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Herbert Göttler Hana-Jürgen Schneider

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montonen, E., Ojala, L., Tuuliniemi, T. (1988). A PrT-net representation of graph grammars. In: Göttler, H., Schneider, HJ. (eds) Graph-Theoretic Concepts in Computer Science. WG 1987. Lecture Notes in Computer Science, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19422-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-19422-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39264-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation