Petri Nets with Simple Circuits(Fundamentals of Software and Theory of Programs)

スポンサーリンク

概要

• 論文の詳細を見る

• We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.

• 社団法人電子情報通信学会の論文
• 2005-09-01

著者

• Yen Hsu‐chun

  Kainan Univ. Taoyuan Twn

• Yu Lien-po

  Candidate In The Department Of Electrical Engineering National Taiwan University

• YEN Hsu-Chun

  Faculty of Department of Electrical Engineering, National Taiwan University

関連論文

• Petri Nets with Simple Circuits(Fundamentals of Software and Theory of Programs)

スポンサーリンク