A heuristic algorithm FMDB for the minimum initial marking problem of Petri nets
This paper proposes a new heuristic algorithm FMDB for the minimum initial marking problem MIM of Petri nets: "Given a Petri net and a firing count vector X, find an initial marking M(0), with the minimum total token number, for which there is a sequence delta of transitions such that each transition t appears exactly X(t) times in delta, the first transition is firable on M(0) and the rest can be fired one by one subsequently." Experimental results show that FMDB produces better solutions than any known algorithm.
petri nets minimal initial markings legal firing sequences deficient siphons