Abstract
The canonical form of the synthesis problem asks for exact realizations of transition systems. In this chapter we study some variations on that theme. In one case, we relax the constraint that the reachability graph of the synthesized net be isomorphic to the initial transition system, and allow it to be a quotient.
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
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Badouel, E., Bernardinello, L., Darondeau, P. (2015). Other Forms of the Synthesis Problem. In: Petri Net Synthesis. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47967-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-47967-4_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47966-7
Online ISBN: 978-3-662-47967-4
eBook Packages: Computer ScienceComputer Science (R0)