Abstract
In this chapter, \( A = \left( {S,\,E,\,\Delta,\,s_0 } \right) \) is a finite initialized transition system, reachable and reduced, with set of events \( E = \left\{ {e_1, \ldots e_n } \right\} \). Since the transition relation \( \Delta \subseteq S \times E \times S \) is deterministic it can equivalently be given as a partial map \( \delta :S \times E \to S \) with \( \delta \left( {s,\,e} \right) = s^{\prime} \Leftrightarrow \left( {s,\,e,\,s^{\prime}} \right) \in \Delta \).
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). Synthesis of P/T-Nets from Finite Initialized Transition Systems. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-662-47967-4_8
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)