A heuristic algorithm for the minimum initial marking problem of Petri nets

This paper proposes a heuristic algorithm YWMIM 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, with the minimum total token number, for which there is a sequence δ of transitions such that each transition t appears exactly X(t) times in δ, the first transition is firable on M and the rest can be fired one by one subsequently.” Experimental results show that YWMIM produces better solutions than the algorithm AMIM that was known to have higher performance than the algorithm in Onaga et al. (1987)