Abstract
This chapter describes several general techniques aimed at accelerating Petri net synthesis from labelled transition systems. One technique, called presynthesis, eliminates non-synthesisable transition systems before actual synthesis is started. Other techniques, called divide-and-conquer, aim at exploiting a transition system’s structure in order to speed up synthesis. In the divide-and-conquer approach, the synthesis problem is broken up into several subproblems which are smaller and easier to solve, and whose solution can be combined to an overall solution. One method attempts to detect hidden concurrency in a given transition system, and to determine independent parts which consequently can be factored out. Another method attempts to detect loose couplings between transition system parts, and then to separate these parts into smaller subproblems.
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). Divide-and-Conquer Methods for Synthesis. In: Petri Net Primer. Computer Science Foundations and Applied Logic. Birkhäuser, Cham. https://doi.org/10.1007/978-3-031-48278-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-48278-6_13
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)