Simulation of Boolean Petri Nets

Boolean Petri Nets can be simulated by normal Petri Nets as follows:
  1. Each place p is replaced by two places pt and pf.
  2. Each transition t is replaced by 2n transitions, where n is the number of outgoing places of t that are not also input places of t. The figure below shows this construction.
Although this construction has an exponential factor, it is only exponential in the number of outgoing places, which corresponds to the number of nodes that are activated by following a link. In most cases this number will be 1, and in the other cases it is almost always a small number.