S3PR网的严格极小信标计算方法

doi:10.3969/j.issn.1001-2400.2014.04.032

Abstract

Abstract:

Petri nets are used to model the concurrent execution and the deadlock problem in a flexible manufacturing system (FMS). Strict minimal siphons (SMS) play an important role in the development of deadlock control policies for FMS. In this paper, for a class of Petri nets called Systems of Simple Sequential Processes with Resources (S³PR), we propose a more effective method to compute SMS by analyzing a special class of places in S³PR. First, the concept of special places is proposed. Next, by analyzing the relationship between the special places and the loop resource subsets, some conditions for loop resource subsets to generate SMS are established. Based on those conditions, we can compute SMS effectively. Experimental results show that the proposed method is an effective one when the special places exist in S³PR.

Key words: deadlock, flexible manufacturing systems, Petri net, strict minimal siphons

YOU Dan;LIU Miao;WU Wenhui;WANG Shouguang. Method to compute the strict minimal siphon for S³PR[J].J4, 2014, 41(4): 193-197+204.

References

［1］ Murata T. Petri Nets: Properties, Analysis, and Applications［J］. Proceeding of the IEEE, 1989, 77(4): 541-580.
［2］ Ezpeleta J, Colom J M, Martinez J. A Petri Net Based Deadlock Prevention Policy for Flexible Manufacturing Systems［J］. IEEE Transactions on Robotics and Automation, 1995, 11(2): 173-184.
［3］王安荣, 李志武. 基本信标计算的一种快速算法［J］. 西安电子科技大学学报, 2008, 35(4): 632-638.
Wang Anrong, Li Zhiwu. Effective Algorithm for Obtaining a Set of Elementary Siphons［J］. Journal of Xidian University, 2008, 35(4): 632-638.
［4］ Wang Shouguang, Zhou Mengchu, Wang Chengying. Extracting All Minimal Siphons from Maximal Unmarked Siphons in Manufacturing-oriented Petri Nets ［C］//IEEE International Conference on Automation Science and Engineering. Piscataway: IEEE, 2011: 399-404.
［5］ Wang Shouguang, Wang Chengying, Zhou Mengchu. A Method to Compute Strict Minimal Siphons in S³PR Based on Loop Resource Subsets ［J］. IEEE Transactions on Systems, Man, and Cybernetics Systems, 2012, 42(1): 226-237.
［6］ Wang Shouguang, Li Yue, Wang Chengying, et al. Computation of All Minimal Siphons in Petri Nets［C］//Proceedings of 9th IEEE Conference on Networking, Sensing and Control. Piscataway: IEEE, 2012: 4651
［7］ Liu Xiangling, Wang Anrong, Li Zhiwu. A Fast Algorithm to Find a Set of Elementary Siphons for a Class of Petri Nets［C］//Proceedings of IEEE International Conference on Automation Science and Engineering. Piscataway: IEEE, 2006: 399-404.
［8］ Xing Keyi, Zhou Mengchu, Wang Feng, et al. Resource Transition Circuits and Siphons for Deadlock Control of Automated Manufacturing Systems［J］. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, 2011, 41(1): 74-84.
［9］ Li Zhiwu, Zhou Mengchu. Control of Elementary and Dependent Siphons in Petri Nets and Their Application［J］. IEEE Transactions on System, Man, and Cybernetics Part A: Systems and Humans, 2008, 38(1): 133-148.
［10］ Li Zhiwu, Zhao Mi. On Controllability of Dependent Siphons for Deadlock Prevention in Generalized Petri Nets ［J］. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, 2008, 38(2): 369-384.

[1]	WANG Qi;CHEN Xiaoliang. Algorithm for estimating confusion states of flexible manufacturing systems [J]. Journal of Xidian University, 2017, 44(2): 69-74.
[2]	MA Ziyue;TONG Yin. Supervisor synthesis in Petri nets based on basis marking graphs [J]. Journal of Xidian University, 2016, 43(6): 68-73.
[3]	JIANG Zhongyuan;ZHANG Xiuyan;MA Ziyue. Capacity optimization for power storage systems in smart grids [J]. J4, 2015, 42(6): 106-112.
[4]	ZHANG Xiuyan;ZHONG Chunfu;JIA Jianyuan. Method to compute the reachability set of S³PR [J]. J4, 2015, 42(5): 105-109.
[5]	ZHANG Li;ZHAO Liangxu;WANG Shouguang;WANG Chengying. Optimal linear constraint transformation method for α-nets [J]. J4, 2015, 42(5): 183-187+212.
[6]	CHEN Xiaoliang;JIANG Zhongyuan;YE Jianhong . Confusion detection and prevention policies for workflow nets [J]. J4, 2015, 42(2): 77-83.
[7]	ZHU Chengcheng;DONG Lida. Concurrency bug test for a class of multithreaded software [J]. J4, 2015, 42(2): 167-173+212.
[8]	HONG Liang. On efficient estimation of reachable markings for S³PR [J]. J4, 2014, 41(3): 169-173.
[9]	LI Ye;WANG Yinghui;YU Zhenhua. Formal modeling of cyber-physical systems using object-oriented Petri nets [J]. J4, 2014, 41(2): 165-171.
[10]	WANG Qi;WANG Anrong;PU Xuqiang. Computation of special markings of Petri nets of manufacturing systems [J]. J4, 2013, 40(6): 85-91.
[11]	YAO Lei;CAI Jueping;LI Zan;ZHANG Hailin;WANG Shaoli. Fault-tolerant routing algorithm for the 2D-mesh network-on-chip without using virtual channels [J]. J4, 2012, 39(6): 26-33.
[12]	ZHANG Man;DUAN Zhenhua. Synthesis rules of WF-nets and their application in process design [J]. J4, 2012, 39(2): 200-206.
[13]	CHEN Yu-feng;LI Zhi-wu. Computation of marking/transition separation instances for safe Petri nets using BDD [J]. J4, 2010, 37(1): 119-124+141.
[14]	. Deadlock prevention approach for a class of timed Petri nets [J]. J4, 2009, 36(5): 902-908.
[15]	ZHU Sen;LI Zhi-wu. On the colored Petri net model of the C³I system of the double aircraft carriers group [J]. J4, 2009, 36(4): 661-668.

Method to compute the strict minimal siphon for S³PR

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10

Method to compute the strict minimal siphon for S3PR

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10

Method to compute the strict minimal siphon for S³PR