Abstract
In this chapter, we show that P/T-net synthesis may serve not only to obtain compact representations of initialized transition systems—by making explicit the concurrency of some events—but also to obtain distributed implementations thereof.
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). Extracting Concurrency from 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-47967-4_11
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)