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 H2O WWWWWWWWWWW CO2 WWW Ca(HCO3)2

WWWWWW Ca(OH)2 WWWWWWWWWW H2CO3 WWWW CaCO3







>



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