1-1hit |
Shin'ichiro NISHI Satoshi TAOKA Toshimasa WATANABE
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 M0, 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 M0 and the rest can be fired one by one subsequently. " Experimental results show that FMDB produces better solutions than any known algorithm.