Advertisement

Hierarchical Coloured Petri Nets

  • Kurt Jensen
Chapter
  • 79 Downloads
Part of the EATCS Monographs in Theoretical Computer Science book series (EATCS)

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.

Keywords

Ring Network Telephone System Substitution Transition Transition Instance Port Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Kurt Jensen
    • 1
  1. 1.Computer Science DepartmentAarhus UniversityAarhus CDenmark

Personalised recommendations