A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets

摘要

This paper proposes a new heuristic algorithm FMDB for the minimuminitial marking problem MIM of Petri nets: "Given a Petri net and afiring count vector X, find an initial marking Mo, with the minimumtotal token number, for which there is a sequence δ, the firsttransition is sition t appears exactly X(t) times in δ, the firsttransition is firable on Mo and the rest can be fired one by onesubsequently." Experimental results show that FMDB produces bettersolutions than any known algorithm.