制造系统Petri网特殊标识求解算法

doi:10.3969/j.issn.1001-2400.2013.06.015

Abstract

Abstract:

This paper proposes a method to find the set of dangerous markings of Petri nets based on integer programming by computing a partial set of reachability markings. The proposed method can be used to find all deadlock markings by employing the definition of deadlock markings and the structure information(P-invariant) on Petri nets. Then the state equation is used to derive the sets of bad and dangerous markings. Finally, using the Petri net model of a manufacturing system，we verify the computation of special markings(such as deadlock markings and dangerous markings). Experimental results show that the special markings can be computed by obtaining the partial reachability graph，which reduces state the space explosion problem.

Key words: integer programming, Petri nets, dangerous markings, deadlock control

WANG Qi;WANG Anrong;PU Xuqiang. Computation of special markings of Petri nets of manufacturing systems[J].J4, 2013, 40(6): 85-91.

References

［1］ Ezpeleta J, Colom J M, Martinez J. A Petri Net Based Deadlock Prvention Policy for Flexible Manufacturing Systems ［J］. IEEE Transcations on Robotics and Automation, 1995, 11(2): 173-184.
［2］陈玉峰, 李志武. 安全Petri网事件分离状的BDD算法［J］. 西安电子科技大学学报, 2010, 37(1): 119-124.
Chen Yufeng, Li Zhiwu. Computation of Marking/Transition Separation Instances for Safe Petri Nets Using BDD ［J］. Journal of Xidian University, 2010, 37(1): 119-124.
［3］ Zhu Rongming. Deadlock Prvention Approach for Flexible Manufacturing Systems with Uncontrollable Transitions in Their Petri Net Models ［J］. Asian Journal of Control, 2012, 14(1): 217-229.
［4］ Daniel Y C. A New Optimal Control Policy for a Well-known S³PR(Systems of Simple Sequential Processes with Resources) ［J］. International Journal of Production Research, 2012, 50(22): 6259-6271.
［5］ Wu Naiqi, Zhou Mengchu, Hu Gang. One-Step Look-Ahead Maximally Permissive Deadlock Control of AMS by Using Petri Nets ［J］. ACM Transactions on Embedded Computing Systems(TECS), 2013, 12(10): 1-23.
［6］ Chen Yufeng, Li Gaiyun. Computation of Minimal Siphons in Petri Nets by Using Binary Decision Diagrams ［J］. ACM Transactions on Embedded Computing Systems(TECS), 2013, 12(3): 1-15.
［7］ Hu Hesuan, Zhou Mengchu, Li Zhiwu, et al. Deadlock-free Control of Automated Manufacturing Systems with Flexible Routes and Assembly Operations Using Petri Nets ［J］. IEEE Transactions on Industrial Informatics, 2013, 9(1): 109-121.
［8］ Ghaffari A, Rezg N, Xie X L. Design of a Live and Maximally Permissive Petri Net Controller Using the Theory of Regions ［J］. IEEE Transcations on Robotics and Automation, 2003, 19(1): 137-142.
［9］ Chen Yufeng, Li Zhiwu. Design of a Maximally Permissive Liveness-enforcing Supervisor with a Compressed Supervisory Structure for Flexible Manufacturing Systems ［J］. IEEE Transcations on Automation and Engineering, 2011, 8(2): 374-393.
［10］ Li Zhiwu, Zhou Mengchu. Deadlock Resolution in Automated Manufacturing Systems: a Novel Petri Net Approach ［M］. London: Springer Verlag, 2009.
［11］李志武, 周孟初. 自动制造系统建模、分析与死锁控制［M］. 北京: 科学出版社, 2009.

[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]	JIANG Zhongyuan;ZHANG Xiuyan;MA Ziyue. Capacity optimization for power storage systems in smart grids [J]. J4, 2015, 42(6): 106-112.
[3]	ZHANG Xiuyan;ZHONG Chunfu;JIA Jianyuan. Method to compute the reachability set of S³PR [J]. J4, 2015, 42(5): 105-109.
[4]	ZHANG Li;ZHAO Liangxu;WANG Shouguang;WANG Chengying. Optimal linear constraint transformation method for α-nets [J]. J4, 2015, 42(5): 183-187+212.
[5]	CHEN Xiaoliang;JIANG Zhongyuan;YE Jianhong . Confusion detection and prevention policies for workflow nets [J]. J4, 2015, 42(2): 77-83.
[6]	ZHU Chengcheng;DONG Lida. Concurrency bug test for a class of multithreaded software [J]. J4, 2015, 42(2): 167-173+212.
[7]	LI Ye;WANG Yinghui;YU Zhenhua. Formal modeling of cyber-physical systems using object-oriented Petri nets [J]. J4, 2014, 41(2): 165-171.
[8]	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.
[9]	. Deadlock prevention approach for a class of timed Petri nets [J]. J4, 2009, 36(5): 902-908.
[10]	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.
[11]	MI Zhi-chao1;2;BAO Min-quan3;ZHOU Jian-jiang1. Multi-object optimization routing algorithm based on fuzzy decision making for wireless sensor networks [J]. J4, 2008, 35(4): 721-725.
[12]	WANG An-rong;DUAN Jiang-tao;LI Zhi-wu;JIA Jian-yuan. On the forbidden state avoidance of resource allocation systems [J]. J4, 2005, 32(5): 742-747.
[13]	MA Yu-xiang;LI Yuan-jun;LIU Yan-ming. A modeling and verification method for ingtelligent networks services with Petri nets [J]. J4, 2004, 31(2): 194-198.
[14]	LI Zhi-wu;WANG An-rong;JIA Jian-yuan. Methods for solving invariants and state equations for Petri nets [J]. J4, 2003, 30(2): 259-263.

Computation of special markings of Petri nets of manufacturing systems

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 14

Metrics

Comments

Recommended 0