Coloured Petri Nets

By Stephane Demri, Ewa Orlowska. Monographs in Theoretical Computer Science. An EATCS Series, 2002

1,656 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Soundness of workflow nets: classification, decidability, and analysis (2011, methodology): “This section introduces basic Petri-net related concepts [DE95, Jen97, Mur89] used in the remainder of this paper.”
Process Mining (2016, unknown): “Colored Petri nets (CPNs) are the most widely used Petri-net based formalism that can deal with data-related and time-related aspects [82, 149].”
Design and Implementation of the YAWL System (2004, unknown): “However, even though Petri nets (including higher-order Petri nets such as Colored Petri nets [12]) support a number of the identified patterns, they do not provide direct support for the cancellation patterns (in particular the cancellation of a whole case or a region), the synchronizing merge patt”
Reinforcement learning based resource allocation in business process management (2011, unknown): “Resource patterns are comparable and then a reference model is provided based on Color Petri Net (CPN) Tools [53,54].”
Semantic Networks (2014, background): “In Figure 15, each token represents a single bit of information, but an extension, called colored Petri nets, can associate an arbitrary amount of data with each token (Jensen 1992).”