Abstract
Many important properties of Petri nets can be analyzed by means of Petri net reachability and coverability graphs. The reachability graph relates to the Petri net marking reachability. A frequently asked question is whether a given marking m is reachable by a transition firing sequence. First let us define the transition firing sequence. The starting marking is important in that question.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Properties of Petri Nets. In: Modeling and Control of Discrete-event Dynamic Systems. Advanced Textbooks in Control and Signal Processing. Springer, London. https://doi.org/10.1007/978-1-84628-877-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-84628-877-7_8
Publisher Name: Springer, London
Print ISBN: 978-1-84628-872-2
Online ISBN: 978-1-84628-877-7
eBook Packages: EngineeringEngineering (R0)