By Topic

A new heuristic method for solving the minimum initial marking problem of Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Nishi ; Fac. of Eng., Hiroshima Univ., Japan ; S. Taoka ; T. Watanabe

The paper proposes a novel 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, 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 FMDB produces better solutions than any known algorithm

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:5 )

Date of Conference: