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

Authors
Nishi, S Taoka, S Watanabe, T
Citation
S. Nishi et al., A heuristic algorithm FMDB for the minimum initial marking problem of Petri nets, IEICE T FUN, E84A(3), 2001, pp. 771-780
Citations number
16
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
ISSN journal
09168508 → ACNP
Volume
E84A
Issue
3
Year of publication
2001
Pages
771 - 780
Database
ISI
SICI code
0916-8508(200103)E84A:3<771:AHAFFT>2.0.ZU;2-G
Abstract
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 ve ctor X, find an initial marking M-0, with the minimum total token number, f or which there is a sequence delta of transitions such that each transition t appears exactly X(t) times in delta, the first transition is firable on M-0 and the rest can be fired one by one subsequently." Experimental result s show that FMDB produces better solutions than any known algorithm.