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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Nagl.: Graph-Grammatiken.— Vieweg Verlag Wiesbaden
C.A. Petri: Nicht-sequentielle Prozesse.— GMD-ISF Interner Bericht 76-6
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reisig, W. (1981). A graph grammar representation of nonsequential processes. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive