A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.3 pp.771-780
- Publication Date
- 2001/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shin'ichiro NISHI, Satoshi TAOKA, Toshimasa WATANABE, "A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 771-780, March 2001, doi: .
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 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_771/_p
Copy
@ARTICLE{e84-a_3_771,
author={Shin'ichiro NISHI, Satoshi TAOKA, Toshimasa WATANABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets},
year={2001},
volume={E84-A},
number={3},
pages={771-780},
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 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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 771
EP - 780
AU - Shin'ichiro NISHI
AU - Satoshi TAOKA
AU - Toshimasa WATANABE
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - 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.
ER -
English
