An Algebraic Criterion for State Machine Allocatable Nets(Special Section on Concurrent Systems Technology)
スポンサーリンク
概要
- 論文の詳細を見る
Silva et al.has suggested a criterion based on incidence matrix to verify if a given extended free choice net has a live and bounded marking. This paper shows that this criterion is a necessary and sufficient condition that a given net is a state machine allocatable(SMA)net. This result gives a polynomial algorithm to verify SMA net.
- 社団法人電子情報通信学会の論文
- 1998-04-25
著者
-
Hisamura Tomiji
The Author Is With The School Of Science And Engineering Waseda University
-
OHTA Atsushi
The authors are with the Faculty of Information Science and Technology, Aichi Prefectural University
-
Ohta Atsushi
The Author Is With The Faculty Of Information Science And Technology Aichi Prefectural University
関連論文
- NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net(Special Section on Discrete Mathematics and Its Applications)
- An Algebraic Criterion for State Machine Allocatable Nets(Special Section on Concurrent Systems Technology)