Arumugham, R.; Thirusangu, K.; David, N. G.; Thomas, D. G. Reachability graphs of Petri nets and graph grammars. (English) Zbl 1116.68055 Far East J. Math. Sci. (FJMS) 23, No. 2, 193-200 (2006). Summary: We show that there exists a hyperedge replacement graph grammar with rendezvous to generate the reachability graph of a Petri net. MSC: 68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) 68Q42 Grammars and rewriting systems Keywords:hyperedge replacement graph grammer PDFBibTeX XMLCite \textit{R. Arumugham} et al., Far East J. Math. Sci. (FJMS) 23, No. 2, 193--200 (2006; Zbl 1116.68055)