Siphons are related to the liveness property of Petri net models of concurrent systems. Elementary siphons, an important concept proposed in our previous work, has been proved to be an effective way to characterize, analyze, and control deadlocks in these systems. This paper first surveys the existing results on elementary siphons of Petri nets. It is proved that the number of elementary siphons in a Petri net is bounded by the smaller of place count and transition count. We investigate the conditions under which there is no weakly dependent siphon in a Petri net. A polynomial algorithm is developed to decide the set of elementary siphons for the deadlock control purpose. Some interesting and open problems on elementary siphons are finally discussed.
|Original language||English (US)|
|Number of pages||6|
|Journal||Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics|
|State||Published - Dec 1 2004|
All Science Journal Classification (ASJC) codes