This chapter introduces the concepts of non-hierarchical Coloured Petri Nets. This is done by means of a running example consisting of a set of simple communication protocols. Protocols are used because they are easy to explain and understand, and because they involve concurrency, non-determinism, communication, and synchronisation which are key characteristics of concurrent systems. No preliminary knowledge of protocols is assumed.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jensen, K., Kristensen, L.M. (2009). Non-hierarchical Coloured Petri Nets. In: Coloured Petri Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/b95112_2
Download citation
DOI: https://doi.org/10.1007/b95112_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00283-0
Online ISBN: 978-3-642-00284-7
eBook Packages: Computer ScienceComputer Science (R0)