Coloured Petri net

Coloured Petri nets (CPN) are a backward compatible extension of the concept of Petri nets.

CPN preserve useful properties of Petri nets and at the same time extend initial formalism to allow the distinction between tokens.[1]

Coloured Petri Nets allow tokens to have a data value attached to them. This attached data value is called token color. Although the color can be of arbitrarily complex type, places in CPNs usually contain tokens of one type. This type is called color set of the place.

Definition 1. A net is a tuple N = (P, T, A, Σ, C, N, E, G, I ) where:

In CPNs sets of places, transitions and arcs are pairwise disjoint P T=P A=T A=

Use of node function and arc expression function allows multiple arcs connect the same pair of nodes with different arc expressions.

A well-known softwareprogram is cpntools.

References

  1. Jensen, Kurt (1996). Coloured Petri Nets (2 ed.). Berlin: Heidelberg. p. 234. ISBN 3-540-60943-1.
This article is issued from Wikipedia - version of the Wednesday, April 06, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.