Reachability Criterion for Petri Nets with Known Firing Count Vectors(Special Section on Concurrent Systems Technology)

スポンサーリンク

概要

• 論文の詳細を見る

• A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet N_w. This result is based on the decomposition of a given net(N, M_o)with M_d and the concepts of "no immature siphon at the reduced initial marking M_wo" and "no immature trap at the reduced end marking M_wd" on N_w which are both extended from "no token-free siphon at the initial marking M_o" and "no token-free trap at the end marking M_d" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.

• 社団法人電子情報通信学会の論文
• 1998-04-25

著者

• Miyano Yasushi

  The Authors Are With The Faculty Of Engineering Fukui University

• MATSUMOTO Tadashi

  The authors are with the Faculty of Engineering, Fukui University

• Matsumoto Tadashi

  The Author Is With Ntt Mobile Communications Network Inc.

• Matsumoto Tadashi

  The Authors Are With The Faculty Of Engineering Fukui University

関連論文

• Reachability Criterion for Petri Nets with Known Firing Count Vectors(Special Section on Concurrent Systems Technology)
• Zero Forcing and Decision Feedback Detectors in MIMO Communication Channels and Their Applications to Frequency-Overlapped Multi-Carrier Signaling

スポンサーリンク