Petri nets and their relation to graph grammars
Part of the Lecture Notes in Computer Science book series (LNCS, volume 153)
- 135 Downloads
KeywordsConcurrent System Graph Grammar Token Distribution Boundedness Problem Generalise Handle
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.
Unable to display preview. Download preview PDF.
- W. Brauer, Net Theory and Applications, Lecture Notes in Computer Science, Springer, Vol. 84, 1980.Google Scholar
- H. Ehrig and H.J. Kreowski, Church-Rosser Theorems Leading to Parallel and Canonical Derivations for Graph Grammars, Technical Report 75-27, FB Kybernetik, T.U. Berlin, 1975.Google Scholar
- H.J. Genrich, D. Janssens, G. Rozenberg, P.S. Thiagarajan, Generalised Handle Grammars and their Relations to Petri nets, ISF-Report 82.06, GMD, St. Augustin, W. Germany, 1982.Google Scholar
- H.J. Genrich, K. Lautenbach and P.S. Thiagarajan, Elements of General Net Theory, Lecture Notes in Computer Science, Springer, Vol. 84, 21–163, 1980.Google Scholar
- D. Janssens and G. Rozenberg, On the Structure of Node-Label-Controlled Graph Languages, Information Sciences 20, 191–216, 1980.Google Scholar
- H.J. Kreowski, A comparison between Petri Nets and Graph Grammars, Lecture Notes in Computer Science, Springer, Vol. 100, 306–317, 1981.Google Scholar
- J.L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, 1981.Google Scholar
- W. Reisig, A Graph Grammar Representation of Nonsequential Processes, Lecture Notes in Computer Science, Springer, Vol. 100, 318–325, 1981.Google Scholar
© Springer-Verlag Berlin Heidelberg 1983