Reproducibility of the Empty Marking

Abstract

The main theorem of the paper states that the empty marking Ø is reproducible in a p/t-net $\mathcal{N}$ if and only if there are reproducing T-invariants whose net representations have neither traps nor co-traps (deadlocks, siphons). This result is to be seen in connection to modeling processes, since all processes which have a start and a goal event usually reproduce the empty marking.