Abstract
This chapter contains the formal definition of non-hierarchical CP-nets and their behaviour. A non-hierarchical CP-net is defined as a many-tuple. However, it should be understood that the only purpose of this is to give a mathematically sound and unambiguous definition of CP-nets and their semantics. Any concrete net, created by a modeller, will always be specified in terms of a CPN diagram (i.e., a diagram similar to Figs. 1.7 and 1.13) — or by a hierarchical CPN diagram (to be introduced in Chap. 3). It is in principle (but not in practice) easy to translate a CPN diagram into a CP-net tuple, and vice versa. The tuple form is adequate when we want to formulate general definitions and prove theorems which apply to all (or a large class) of CP-nets. The graph form is adequate when we want to construct a particular CP-net modelling a specific system.
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). Formal Definition of 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-03241-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08243-6
Online ISBN: 978-3-662-03241-1
eBook Packages: Springer Book Archive