Abstract
In the hierarchy of structurally defined Petri net classes, choice-free nets lie above marked graphs, but their reachability graphs are still persistent. Thus, they inherit the properties of Petri nets with persistent reachability graphs. In this chapter, we show that they also enjoy properties that resemble some of the properties of marked graphs. This leads to a rich assortment of necessary synthesisability properties that may be exploited for pre-synthesis and ultimately for synthesis, when a synthesis problem targets a choice-free net.
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). Bounded Choice-Free Net Synthesis. In: Petri Net Primer. Computer Science Foundations and Applied Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-48278-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-48278-6_15
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)