A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
スポンサーリンク
概要
- 論文の詳細を見る
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 M_0, 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_0 and the rest can be fired one by one subsequently." Experimental results show that FMDB produces better solutions than any known algorithm.
- 社団法人電子情報通信学会の論文
- 2001-03-01
著者
-
Taoka Satoshi
Department Of Circuits And Systems Faculty Of Engineering Hiroshima University
-
Watanabe Toshimasa
Department Of Circuits And Systems Faculty Of Engineering Hiroshima University
-
Nishi Shin'ichiro
Department Of Circuits And Systems Faculty Of Engineering Hiroshima University
関連論文
- Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets (Special Section on Concurrent Systems Technology)
- Graph Augmentation Problems with Degree-Unchangeable Vertices(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- A Heuristic Algorithm FMDB for the Minimum Initial Marking Problem of Petri Nets(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)
- Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net (Special Section on Concurrent Systems Technology)