Computation of all minimal siphons in Petri nets

Wang, S. G.; Li, Y.; Wang, C. Y.; Zhou, MengChu

doi:10.1109/icnsc.2012.6204889

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2017

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Complete enumeration of minimal siphons in ordinary Petri nets based on problem partitioning

Wang

You

Seatzu

et al. 2015

2015 54th IEEE Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

A siphon is a structural object in Petri nets that is important both from a theoretical and a practical point of view. Particularly, the performance of siphon-based deadlock control policies largely depends on siphon enumeration. This work studies complete minimal-siphon enumeration in ordinary Petri nets. A recent approach, called global partitioning minimal-siphon enumeration (GPMSE) has been recently proposed by Cordone et al. [1] and provides good performance compared with other methods. In this paper we show that further improvements are possible and we propose a novel approach, called improved GPMSE, which requires lower computational complexity and memory consumption than the original method, especially for nets with large size. Experimental results are presented to validate the above claim

show abstract