Abstract
If the free-choice structure is further restricted such that it does not allow any choices at all, the result is a marked graph. This restriction greatly simplifies the analysis. In particular, for each marked graph N, there exists an initial marking such that N is live and 1-bounded.
This is a preview of subscription content, log in via an institution to check access.
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). Marked Graphs. In: Understanding Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33278-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-33278-4_18
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)