Abstract
In Chaps. 1 and 2 we presented non-hierarchical CP-nets. In this chapter we shall see how these can be extended to hierarchical nets, i.e., how it is possible to construct a large CP-net by combining a number of smaller nets. A hierarchical CP-net can be constructed top-down, bottom-up, or by mixing these two strategies.
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
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jensen, K. (1996). Hierarchical Coloured Petri Nets. In: Coloured Petri Nets. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03241-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-662-03241-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08243-6
Online ISBN: 978-3-662-03241-1
eBook Packages: Springer Book Archive