Abstract
A marked Petri net may be considered as a finite description of an (in general) infinite set of nonsequential processes. Such a process is represented as a labelled graph; thus the process set of a marked net is a graph language. This language is produced by a graph grammar which can be derived from the net. This construction yields a bijection between the set of marked Petri nets and a distinguished class of graph grammars.
Cite
CITATION STYLE
Reisig, W. (1981). A graph grammar representation of nonsequential processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 100 LNCS, pp. 318–325). Springer Verlag. https://doi.org/10.1007/3-540-10291-4_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
