Colored nets; Condition event nets; Place transition nets
The Petri net formalism provides a graphical but also formal language which is appropriate for modeling systems and processes with concurrency and resource sharing. It was introduced in the beginning of the 1960s by Carl Adam Petri and was the first formalism to adequately describe concurrency. The classical Petri net is a directed bipartite graph with two node types called places and transitions. The nodes are connected via directed arcs. Places are represented by circles and transitions by rectangles. The network structure of the Petri net is static. However, places may contain tokens, and the distribution of tokens of places may change as described in the firing rule. Petri nets have formal semantics and allow for all kinds of analysis. Moreover, due to the strong theoretical foundation, much is known about the properties of different subclasses of Petri nets. Petri nets have been extended in many...
- 1.Brauer W, Reisig W. Carl Adam Petri and Petri Nets. Informatik-Spektrum. 1996;29(5):369–74.Google Scholar
- 5.Petri CA. Kommunikation mit Automaten. PhD Thesis, Fakultät für Mathematik und Physik, Technische Hochschule Darmstadt, Darmstadt, 1962.Google Scholar
- 8.van der Aalst WMP, van Hee KM. Workflow management: models, methods, and systems. Cambridge, MA: MIT Press; 2004.Google Scholar
- 9.van der Aalst WMP. Process Mining: Data Science in Action. Springer-Verlag, Berlin, 2016.Google Scholar