A PrT-net representation of graph grammars
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.
KeywordsProduction Rule Direct Derivation Graph Production Graph Grammar Static Formula
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 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
- W. Reisig. Petri Nets, an Introduction, Springer-Verlag, Berlin. 1982.Google Scholar