An Algorithm for Legal Firing Sequence Problem of Petri Nets Based on Partial Order Method
スポンサーリンク
概要
- 論文の詳細を見る
The legal firing sequence problem of Petri nets (LFS) is one of fundamental problems in the analysis of Petri nets, because it appears as a subproblem of various basic problems. Since LFS is shown to be NP-hard, various heuristics has been proposed to solve the problem of practical size in a reasonable time. In this paper, we propose a new algorithm for this problem. It is based on the partial order verification technique, and reduces redundant branches in the search tree. Moreover, the proposed algorithm can be combined with various types of heuristics.
- 社団法人電子情報通信学会の論文
- 2001-11-01
著者
-
Hiraishi Kunihiko
The School Of Information Science Japan Advanced Institute Of Science And Technology
-
TANAKA Hirohide
the School of Information Science, Japan Advanced Institute of Science and Technology
-
Tanaka Hirohide
The School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- An Efficient Algorithm for Exploring State Spaces of Petri Nets with Large Capacities (Special Section on Concurrent Systems Technology)
- An Algorithm for Legal Firing Sequence Problem of Petri Nets Based on Partial Order Method
- A Note on the Complexity of k-Ary Threshold Circuits
- Deriving Discrete Behavior of Hybrid Systems under Incomplete Knowledge