Synthesis of liveness enforcing supervisor for automated manufacturing systems using insufficiently marked siphons
A liveness enforcing supervisor synthesis technique is presented for Petri net modeling automated manufacturing systems. The insufficiently marked siphons are deployed to characterize the deadlock situations in an incidence matrix based way, which makes possible the study of the modeled systems from both structural and algebraic perspectives. The approach generates at each step a generalized mutual exclusion constraint which contains only markings for which liveness can be enforced. To avoid the explicit enumeration of all the set of strict minimal siphons, a set of mathematical programming formulations are established to implement the derivation of insufficiently marked siphons from the PT-transformation of the plant system. Further, a generalized elementary siphon control approach is involved such that the final supervisor can be structurally simplified. Several examples are used to illustrate these results.
KeywordsLiveness enforcing supervision Petri nets Deadlock prevention Automated manufacturing systems
Unable to display preview. Download preview PDF.
- Barkaoui, K., Chaoui, A., & Zouari, B. (1997). Supervisory control of discrete event systems based on structure theory of Petri nets. In Proceedings of IEEE Conference on Systems, Man, and Cybernetics, Paris, France (pp. 3750–3755).Google Scholar
- Barkaoui, K., & Peyre, J. F. (1996). On liveness and controlled siphons in Petri nets. In J. Billington & W. Reisig (Eds.), Proceedings of International Conference on Application and Theory of Petri Nets, Lecture notes in computer science (Vol. 1091, pp. 57–72). Berlin: Springer.Google Scholar
- Hu, H. S., & Li, Z. W. (2009). Liveness enforcing supervision in video streaming systems using siphons. Journal of Information Science and Engineering (to appear).Google Scholar
- Jeng M.D., Xie X.L. (1999) Analysis of modularly composed nets by siphons. IEEE Transactions on Systems, Man and Cybernetics 29(4): 299–406Google Scholar
- Lautenbach, K., & Ridder, H. (1996). The linear algebra of deadlock avoidance—a Petri net approach. University Koblenz, Institue of Computer Science, Germany, Technical Report, 1996.Google Scholar
- Ohta, A., & Tsuji, A. (2003). Insufficiently marked siphon of Petri nets—extension of token-free siphon. In Proceedings of IEEE International Symposium on Circuits and Systems (pp. III244–III244), Bangkok, Thailand, 2003.Google Scholar
- Reveliotis S.A. (2003) On the siphon-based characterization of liveness in sequential resource allocation systems. In: van der Aalst W.M.P., Best E. (eds) Proceedings of International Conference on Application and Theory of Petri Nets, Lecture notes in computer science (Vol. 2679). Springer, Berlin, pp 241–255Google Scholar
- Souissi Y. (1991) On liveness preservation by composition of nets via a set of places. In: Goos G., Hartmanis J. (eds) Advances in Petri nets Lecture notes in computer science (Vol. 542). Springer, Berlin, pp 277–295Google Scholar
- Tricas, F., Colom, J. M., & Ezpeleta, J. (1999). A solution to the problem of deadlocks in concurrent systems using Petri nets and integer linear programming. In Proceedings of the 11th Europe Simulation Symposium (pp. 542–546), Erlangen, Germany.Google Scholar
- Tricas, F., García-Vallés, F., Colom, J. M., & Ezpeleta, J. (2005). A Petri net structure-based deadlock prevention solution for sequential resource allocation systems. In Proceedings of International Conference on Robotics and Automation (pp. 272–278), Barcelona, Spain.Google Scholar