Reachability in Petri Nets with Inhibitor arcs
Klaus Reinhardt
University of Tübingen
Overview:
Petrinets informal
: Firing of a transition
Examples
Inhibitor arc
more Examples
Rest of Presentation
paper
Formal definitions, Multisets, new operators, reachability relation
>
Petrinets:
Representation as weighted, directed, bitartite Graph.
Firing of a transition:
>
Producer
WWWWW
Consumer
>
WWW
Producer 1
WWWWW
Producer 2
>
Chemical reactions
CaO
WWWWWWWWWWW
H
_{2}
O
WWWWWWWWWWW
CO
_{2}
WWW
Ca(HCO
_{3}
)
_{2}
WWWWWW
Ca(OH)
_{2}
WWWWWWWWWW
H
_{2}
CO
_{3}
WWWW
CaCO
_{3}
>
Exponentiation
>
Inhibitor arc
>
Simulating a register
This divides the number by 2 and multiplies by 3:
>
Proposition:
Petrinets with 2 inhibitor arcs are Turing-complete.
>
?
>
Last modified: by
Klaus Reinhardt