Abstract
In the introduction of this book, we had indicated that we aimed at forging as tight and strong links between process algebras and Petri nets as possible. In retrospect, it is possible to say that we have achieved this aim both at the structural and at the behavioural levels. Moreover, we have carried out this investigation not only for a specific process algebra, but rather in a generic way, for the box algebra. The latter encompasses an infinity of concrete process algebras, of which the existing ones can be viewed as suitably adapted derivatives or instances. It is also worth mentioning that we have strived to allow infinity in the definitions and formulations of the results wherever it was possible; in particular, we considered operators with infinitely many arguments.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Best, E., Devillers, R., Koutny, M. (2001). Conclusion. In: Petri Net Algebra. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04457-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-04457-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08677-9
Online ISBN: 978-3-662-04457-5
eBook Packages: Springer Book Archive