Abstract
The marking graph G of a system net N has already been introduced in Section 2.8. Its nodes are the reachable states, its edges the reachable steps of N. We will specify a series of properties of N that are mirrored in G.
However, G is generally infinitely large. We therefore construct the finite covering graph H, which approximates G. A series of necessary or sufficient conditions for some properties of N can be specified by means of H.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reisig, W. (2013). Marking and Covering Graphs. In: Understanding Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33278-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-33278-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33277-7
Online ISBN: 978-3-642-33278-4
eBook Packages: Computer ScienceComputer Science (R0)