LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION.

Tomohiro Murata, Norihisa Komoda

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

The capacity-designated Petri net (CPN), in which each of the places can have at most a designated number of tokens, is a suitable model for describing real system behavior. Liveness analysis of CPN is important to guarantee that a system described using a CPN is deadlock free. The CPN liveness problem can be completely determined by reachability tree analysis, but it needs a large amount of calculation time in proposition to net size power. Three reduction rules are proposed which can be directly applied to the CPN model and preserve the liveness property of original net. The heuristic algorithms for realizing the reduction rules are also proposed, and an example of the reduction process using these algorithms is demonstrated.

本文言語English
ホスト出版物のタイトルUnknown Host Publication Title
出版社IEEE
ページ1960-1965
ページ数6
ISBN(印刷版)0818607874
出版ステータスPublished - 1987 1 1
外部発表はい

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント 「LIVENESS ANALYSIS OF SEQUENCE CONTROL SPECIFICATION DESCRIBED IN CAPACITY DESIGNATED PETRI NET USING REDUCTION.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル