%0 Journal Article %1 PiroddiCossalterFerrarini09 %A Piroddi, L. %A Cordone, R. %A Fumagalli, I. %D 2009 %I IEEE %J Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on %K citeulike deadlock, deadlocks, net, petri, referencias, siphon, siphons %N 3 %P 650--661 %R 10.1109/tsmca.2009.2013189 %T Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets %U http://dx.doi.org/10.1109/tsmca.2009.2013189 %V 39 %X In Petri-net (PN) modeling of flexible manufacturing systems, deadlock prevention is often addressed by means of siphon-control methods. Constraints that avoid the emptying of siphons can be easily implemented using additional places suitably connected to the PN transitions. Efficient siphon-based techniques achieve highly permissive solutions using as few control places as possible. One such technique employs a set-covering approach to optimally match emptiable siphons to critical markings. In this paper, a modified version of the method is proposed that achieves the same results in terms of permissivity and size of the control subnet but avoids full siphon enumeration. This greatly reduces the overall computational time and memory requirements and allows the applicability of the method to large-size models.

@article{PiroddiCossalterFerrarini09, abstract = {{In Petri-net (PN) modeling of flexible manufacturing systems, deadlock prevention is often addressed by means of siphon-control methods. Constraints that avoid the emptying of siphons can be easily implemented using additional places suitably connected to the PN transitions. Efficient siphon-based techniques achieve highly permissive solutions using as few control places as possible. One such technique employs a set-covering approach to optimally match emptiable siphons to critical markings. In this paper, a modified version of the method is proposed that achieves the same results in terms of permissivity and size of the control subnet but avoids full siphon enumeration. This greatly reduces the overall computational time and memory requirements and allows the applicability of the method to large-size models.}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Piroddi, L. and Cordone, R. and Fumagalli, I.}, biburl = {https://www.bibsonomy.org/bibtex/26d8fec9a32b94289faa17c9a51860fa2/fernand0}, citeulike-article-id = {10793566}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/tsmca.2009.2013189}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4781620}, doi = {10.1109/tsmca.2009.2013189}, institution = {Dipt. di Elettron. e Inf., Politec. di Milano, Milan}, interhash = {f48e8458f52c8fe70f01c24379bf8c84}, intrahash = {6d8fec9a32b94289faa17c9a51860fa2}, issn = {1083-4427}, journal = {Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on}, keywords = {citeulike deadlock, deadlocks, net, petri, referencias, siphon, siphons}, month = may, number = 3, pages = {650--661}, posted-at = {2012-06-15 17:20:25}, priority = {2}, publisher = {IEEE}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Combined Siphon and Marking Generation for Deadlock Prevention in Petri Nets}}, url = {http://dx.doi.org/10.1109/tsmca.2009.2013189}, volume = 39, year = 2009 }