%0 Journal Article %1 ZhangWu13 %A Zhang, Zhiming %A Wu, Weimin %C New York, NY, USA %D 2013 %I ACM %J ACM Trans. Embed. Comput. Syst. %K citas, citeulike deadlocks, nets, petri, referencias, siphons %N 1 %R 10.1145/2406336.2406344 %T Sequence Control of Essential Siphons for Deadlock Prevention in Petri Nets %U http://dx.doi.org/10.1145/2406336.2406344 %V 12 %X Deadlock prevention is crucial to the modeling of flexible manufacturing systems. In the Petri net framework, deadlock prevention is often addressed by siphon-based control (SC) policies. Recent research results show that SC methods can avoid full siphon enumeration by using mixed integer programming (MIP) to greatly increase the computational efficiency so that it can be applied in large systems in computable time. Besides, maximally permissive control solutions can be obtained by means of iterative siphon control (ISC) approaches and MIP. Then the remaining problems are redundancy and MIP iterations. Redundant controllers make the closed-loop system more complicated and each MIP iteration increases the total computational time. This article proposes a revised ISC deadlock prevention policy which can achieve better results than the other reported methods in terms of redundancy and MIP iterations while maintaining the maximal permissiveness. Several benchmark examples are provided to illustrate the proposed approach and to be compared with the other reported methods.

@article{ZhangWu13, abstract = {{Deadlock prevention is crucial to the modeling of flexible manufacturing systems. In the Petri net framework, deadlock prevention is often addressed by siphon-based control (SC) policies. Recent research results show that SC methods can avoid full siphon enumeration by using mixed integer programming (MIP) to greatly increase the computational efficiency so that it can be applied in large systems in computable time. Besides, maximally permissive control solutions can be obtained by means of iterative siphon control (ISC) approaches and MIP. Then the remaining problems are redundancy and MIP iterations. Redundant controllers make the closed-loop system more complicated and each MIP iteration increases the total computational time. This article proposes a revised ISC deadlock prevention policy which can achieve better results than the other reported methods in terms of redundancy and MIP iterations while maintaining the maximal permissiveness. Several benchmark examples are provided to illustrate the proposed approach and to be compared with the other reported methods.}}, added-at = {2017-09-08T10:52:59.000+0200}, address = {New York, NY, USA}, author = {Zhang, Zhiming and Wu, Weimin}, biburl = {https://www.bibsonomy.org/bibtex/22c8573ff089a979f195c933d571fb502/fernand0}, citeulike-article-id = {11976125}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=2406336.2406344}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/2406336.2406344}, doi = {10.1145/2406336.2406344}, interhash = {debb7d1b5e53c599813da55ab0387044}, intrahash = {2c8573ff089a979f195c933d571fb502}, issn = {1539-9087}, journal = {ACM Trans. Embed. Comput. Syst.}, keywords = {citas, citeulike deadlocks, nets, petri, referencias, siphons}, month = jan, number = 1, posted-at = {2013-01-31 10:39:14}, priority = {2}, publisher = {ACM}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Sequence Control of Essential Siphons for Deadlock Prevention in Petri Nets}}, url = {http://dx.doi.org/10.1145/2406336.2406344}, volume = 12, year = 2013 }