A Concurrency Characteristic in Petri Net Unfolding(Special Section on Concurrent Systems Technology)

スポンサーリンク

概要

• 論文の詳細を見る

• Unfolding originally introduced by McMillan is gaining ground as a Partial-order based method for the verification of concurrent systems without state space explosion. However, it can be exposed to redundancy which may increase its size exponentially. So far, there have been trials to reduce such redundancy resulting from conflicts by improving McMillan's cut-off criterion[1], [2]. In this paper, we show that concurrency is also another cause of redundancy in unfolding, and present an algorithm to reduce such redundancy in live, bounded and reversible Petri nets which is independent of any cut-off algorithm.

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

著者

• Hwang Chang-hee

  The Author Is With The Dacom R&d Center

• Lee Dong-ik

  The Author Is With The Department Information And Communications Kwang-ju Institute Of Science And T

関連論文

• Automatic Process-Oriented Asynchronous Control Unit Generation from Control Data Flow Graphs
• A Concurrency Characteristic in Petri Net Unfolding(Special Section on Concurrent Systems Technology)

スポンサーリンク