On Liveness of Time POC Nets with the Static Fair Condition
スポンサーリンク
概要
- 論文の詳細を見る
Petri net is a graphical and mathematical modeling tool for discrete event systems. This paper treats analysis problems of time Petri nets. In this model, a minimal and a maximal firing delays are assigned to each transition. If a transition is 'enabled' it can fire after minimal delay has passed and must fire before maximal delay has elapsed. Since time Petri net can simulate register machines, it has equivalent modeling power to that of Turing machine. It means, however, that most of the analysis problems of time Petri nets with general net structures are undecidable. In this paper, net structures are restricted to a subclass called partially ordered condition (POC) nets and dis-synchronous choice (DC) nets. Firing delays are also restricted to satisfy 'static fair condition' which assures chance to fire for all transitions enabled simultaneously. First, a sufficient condition of liveness of time POC net with the static fair condition is derived. Then it is shown that liveness of time DC net with static fair condition is equivalent to liveness of the underlying nontime net. This means that liveness problem of this class is decidable. Lastly, liveness problem of extended free choice (EFC) net is shown to be decidable.
- 社団法人電子情報通信学会の論文
- 1999-08-25
著者
-
OHTA Atsushi
Faculty of Engineering, Kansai University
-
Hisamura Tomiji
School Of Science And Engineering Waseda University
-
Ohta Atsushi
Faculty Of Information Science And Technology Aichi Prefectural University
関連論文
- Optical Resolution by Preferential Crystallization of(RS)-α-Amino-γ-butyrolactone Hydrochloride
- On Liveness of Extended Partially Ordered Condition Nets (Special Section on Concurrent Systems Technology)
- Computational Complexity of Liveness Problem of Normal Petri Net
- On Liveness of Time POC Nets with the Static Fair Condition
- On Liveness of Subclasses of Petri Nets with Permission or Inhibitor Arcs
- Special Section on Selected Papers from the 16th Workshop on Circuits and Systems in Karuizawa
- Verifying Structurally Weakly Persistent Net Is Co-NP Complete
- Special Section on Concurrent/Hybrid Systems : Theory and Applications
- Facile Production of D-Histidine by Asymmetric Transformation of L-Histidine.