14 Facts About Petri nets

1.

Some sources state that Petri nets were invented in August 1939 by Carl Adam Petri—at the age of 13—for the purpose of describing chemical processes.

FactSnippet No. 1,311,193
2.

Unlike these standards, Petri nets have an exact mathematical definition of their execution semantics, with a well-developed mathematical theory for process analysis.

FactSnippet No. 1,311,194
3.

Petri nets are state-transition systems that extend a class of nets called elementary nets.

FactSnippet No. 1,311,195
4.

Similarly, if a Petri nets net is not an elementary net, then the multiset M can be interpreted as representing a non-singleton set of configurations.

FactSnippet No. 1,311,196
5.

One thing that makes Petri nets interesting is that they provide a balance between modeling power and analyzability: many things one would like to know about concurrent systems can be automatically determined for Petri nets, although some of those things are very expensive to determine in the general case.

FactSnippet No. 1,311,197

Related searches

Adam
6.

Several subclasses of Petri nets have been studied that can still model interesting classes of concurrent systems, while these problems become easier.

FactSnippet No. 1,311,198
7.

Petri nets can be described as having different degrees of liveness.

FactSnippet No. 1,311,199
8.

Petri nets net is called k-bounded, safe, or bounded when all of its places are.

FactSnippet No. 1,311,200
9.

Petri nets net is bounded if and only if its reachability graph is finite.

FactSnippet No. 1,311,201
10.

Extensions that cannot be transformed into Petri nets are sometimes very powerful, but usually lack the full range of mathematical tools available to analyse ordinary Petri nets.

FactSnippet No. 1,311,202
11.

Workflow nets are a subclass of Petri nets intending to model the workflow of process activities.

FactSnippet No. 1,311,203
12.

The WF-Petri nets have additional structural and operational requirements, mainly the addition of a single input place with no previous transitions, and output place with no following transitions.

FactSnippet No. 1,311,204
13.

WF-Petri nets have the soundness property, indicating that a process with a start marking of k tokens in its source place, can reach the termination state marking with k tokens in its sink place .

FactSnippet No. 1,311,205
14.

WRI-WF-Petri nets are G-sound, therefore by using only WRI-WF-net building blocks, one can get WF-Petri nets that are G-sound by construction.

FactSnippet No. 1,311,206