全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

一种改进型的S4PR网活性条件

DOI: 10.3724/SP.J.1004.2013.01439, PP. 1439-1446

Keywords: Petri网,S4PR网,活性条件,信标

Full-Text   Cite this paper   Add to My Lib

Abstract:

?研究了顺序资源共享分配系统的建模模型S4PR(Systemsofsequentialsystemswithsharedresources)网的活性问题.已有的研究成果表明,一个S4PR网在所有信标都满足max,max'或max"-controlled时能保持活性,但现有的活性条件对信标的限制严格且不适用于某些网系统,本文提出了一类名为max*-controlled的改进型条件,并证明了当一个S4PR网的所有信标都满足max*-controlled条件时,网系统能保持活性.与现有的其他条件相比,新的活性条件更加宽松,为设计更高允许度的死锁预防或者活性保持监控器提供了理论支撑.

References

[1]  Huang Y S, Pan Y L. Enhancement of an efficient liveness-enforcing supervisor for flexible manufacture systems. The International Journal of Advanced Manufacturing Technology, 2010, 48(5-8): 725-737
[2]  Hu H S, Li Z W. Synthesis of liveness enforcing supervisor for automated manufacturing systems using insufficiently marked siphons. Journal of Intelligent Manufacturing, 2010, 21(4): 555-567
[3]  Ezpeleta J, Colom J M, Martinez J. A Petri net based deadlock prevention policy for flexible manufacturing systems. IEEE Transactions on Robotics and Automation, 1995, 11(2): 173-184
[4]  Park J, Reveliotis S A. Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings. IEEE Transactions on Automatic Control, 2001, 46(10): 1572-1583
[5]  Chao D Y. Max'-controlled siphons for liveness of S3PGR2. IET Control Theory and Applications, 2007, 1(4): 933-936
[6]  Murata T. Petri nets: properties, analysis and applications. Proceedings of the IEEE, 1989, 77(4): 541-580
[7]  Zhong C F, Li Z W. A deadlock prevention approach for flexible manufacturing systems without complete siphon enumeration of their Petri net models. Engineering with Computers, 2009, 25(3): 269-278
[8]  Zhao M, Hou Y F, Liu D. Liveness-enforcing supervisors synthesis for a class of generalised Petri nets based on two-stage deadlock control and mathematical programming. International Journal of Control, 2010, 83(10): 2053-2066
[9]  Shih Y Y, Chao D Y, Chiu C C. A new MIP test for S3PGR2. In: Proceedings of the 16th ISPE International Conference on Concurrent Engineering. New York: Springer, 2009. 41-52
[10]  Fanti M P, Zhou M. Deadlock control methods in automated manufacturing systems. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 2004, 34(1): 5-22
[11]  Chao D Y. Minimal strict siphons extraction for S3PMR. Journal of the Chinese Institute of Engineers, 2010, 33(7): 995-1004
[12]  Li Z W, Zhou M C. Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach. New York: Springer, 2009
[13]  Li Z, Zhang J, Zhao M. Liveness-enforcing supervisor design for a class of generalised Petri net models of flexible manufacturing systems. IET Control Theory and Applications, 2007, 1(4): 955-967
[14]  Abdallah I B, Elmaraghy H A. Deadlock prevention and avoidance in FMS: a Petri net based approach. The International Journal of Advanced Manufacturing Technology, 1998, 14(10): 704-715
[15]  Liu G, Li Z, Zhong C. New controllability condition for siphons in a class of generalised Petri nets. IET Control Theory and Applications, 2010, 4(5): 854-864
[16]  Zhong C F, Li Z W. Self-liveness of a class of Petri net models for flexible manufacturing systems. IET Control Theory and Applications, 2010, 4(3): 403-410
[17]  Li Z W, Zhou M C, Wu N Q. A survey and comparison of Petri net-based deadlock prevention policies for flexible manufacturing systems. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2008, 38(2): 173-188
[18]  Zhao M, Li Z W, Hu H S. Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming. International Journal of Systems Science, 2010, 41(9): 1013-1026
[19]  Liu G, Li Z. General mixed integer programming-based liveness test for system of sequential systems with shared resources nets. IET Control Theory and Applications, 2010, 4(12): 2867-2878

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133