In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'2000), 8-11 October 2000, Nashville, TN, Vol. 4, pages 3218-3223. 2000.
Abstract: This paper proposes a new heuristic algorithm FMDB for the minimum initial marking problem (MIM) for 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 this sequence, the first transition is firable on M and the rest can be fired one by one subsequently. Experimental results show that that FMDB produces better solutions than any known algorithm.
Keywords: FMDB algorithm, Petri nets, minimum initial marking.