An extraction algorithm for a set of elementary siphons based on mixed-integer programming
Shaoyong Li , Zhiwu Li , Hesuan Hu , Abdulrahman Al-Ahmari , Aimin An
Journal of Systems Science and Systems Engineering ›› 2012, Vol. 21 ›› Issue (1) : 106 -125.
An extraction algorithm for a set of elementary siphons based on mixed-integer programming
Elementary siphons are useful in the development of a deadlock prevention policy for a discrete event system modeled with Petri nets. This paper proposes an algorithm to iteratively extract a set of elementary siphons in a class of Petri nets, called system of simple sequential processes with resources (S3PR). At each iteration, by a mixed-integer programming (MIP) method, the proposed algorithm finds a maximal unmarked siphon, classifies the places in it, extracts an elementary siphon from the classified places, and adds a new constraint in order to extract the next elementary siphon. This algorithm iteratively executes until no new unmarked siphons can be found. It finally obtains a unique set of elementary siphons and avoids a complete siphon enumeration. A theoretical analysis and examples are given to demonstrate its efficiency and practical potentials.
Petri net / flexible manufacturing system / deadlock prevention / mixed integer programming / elementary siphon
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
Li, Z.W., Hu, H.S. & Zhou, M.C. (2004b). An algorithm for anoptimal set of elementary siphons in Petri nets for deadlock control. In: Proceedings of 2004 IEEE International Conference on Systems, Man and Cybernetics, Hague, Netherlands, October 10–13, 2004 |
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
Lindo System, Inc. (2011). Premier optimization modeling tools. Availabe via DIALOG. http://www.lindo.com |
| [15] |
Murata, T. (1989). Petri nets: properties, analysis, and applications. In: Proceedings of the IEEE, USA, August 20–22, 1989 |
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
/
| 〈 |
|
〉 |