A simulation method of Petri nets by conflict-free ones

The main problem of this paper is to decide whether a net is safe and persistent. This problem has application at the verification of systems. To decide this problem we propose a method of simulation of ordinary Petri nets by conflict-free ones and prove a proposition about behaviour equivalence of two classes of safe Petri nets: persistent nets and labelled conflict-free nets, which are the result of simulation of persistent nets. The behaviour equivalence proves to be a necessary and sufficient condition for an ordinary net to be safe and persistent