An algorithm for an optimal set of elementary siphons in Petri nets for deadlock control

Document Type

Conference Proceeding

Publication Date

12-1-2004

Abstract

Elementary siphons are important concepts in Petri net theory. Based on them, effective deadlock control can be developed for a net system. The research shows that different sets of elementary siphons has different effects in terms of reachable states using a same control synthesis method. This paper illustrates an algorithm which can find an optimal set of elementary siphons in polynomial time given all siphons. Its use produces more reachable states of the controlled net than other ones do when a same deadlock control policy is applied. Our research starts with theoretical results and ends with experimental ones. © 2004 IEEE.

Identifier

15744399831 (Scopus)

ISBN

[0780385667]

Publication Title

Conference Proceedings IEEE International Conference on Systems Man and Cybernetics

External Full Text Location

https://doi.org/10.1109/ICSMC.2004.1401299

ISSN

1062922X

First Page

4849

Last Page

4854

Volume

5

This document is currently not available here.

Share

COinS