Abstract
By imposing restrictions on the bipartite graphs that may occur as Petri nets, it is possible to distinguish certain classes of nets whose behavioural analysis is more easily possible than for the full class of nets. In this chapter, the focus is on three such classes: S-systems, T-systems, and FC- (free-choice) systems.
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
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Best, E., Devillers, R. (2024). Graph-Theoretical Structure of Petri Nets. In: Petri Net Primer. Computer Science Foundations and Applied Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-48278-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-031-48278-6_5
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-031-48277-9
Online ISBN: 978-3-031-48278-6
eBook Packages: Computer ScienceComputer Science (R0)