针对α网的最优线性约束转换方法

doi:10.3969/j.issn.1001-2400.2015.05.030

J4 ›› 2015, Vol. 42 ›› Issue (5): 183-187+212.doi: 10.3969/j.issn.1001-2400.2015.05.030

针对α网的最优线性约束转换方法

张丽;赵良煦;王寿光;汪成英

(浙江工商大学信息与电子工程学院，浙江杭州 310018)

收稿日期:2014-06-03 出版日期:2015-10-20 发布日期:2015-12-03
通讯作者: 赵良煦
作者简介:张丽(1989-)，女，浙江工商大学硕士研究生，E-mail: wsg5000@hotmail.com．
基金资助:
浙江省杰出青年基金资助项目(LY15F030003, R14F020001); 国家自然科学基金资助项目(61472361); 浙江省科技计划资助项目(2015C31064); 浙江省新型网络标准与应用技术重点实验室资助项目(2013E10012)

Optimal linear constraint transformation method for α-nets

ZHANG Li;ZHAO Liangxu;WANG Shouguang;WANG Chengying

(School of Information ＆ Electronic Eng., Zhejiang Gongshang Univ., Hangzhou 310018, China)

Received:2014-06-03 Online:2015-10-20 Published:2015-12-03
Contact: ZHAO Liangxu

摘要/Abstract

摘要：

针对不可控影响子网为α网的一类Petri网，提出了将给定的广义互斥约束转换成最优允许线性约束的方法．该方法首先获得了该网的不可控影响子网；其次，提出了转换后的禁止库所集集合的求解算法；最后，根据禁止库所集集合构造了“逻辑或”形式的最大允许线性约束．并且通过一个例子，说明了该方法的有效性．

关键词: Petri网, 离散事件系统, 禁止状态, 不可控变迁

Abstract:

For a class of Petri nets whose uncontrollable subnets are α-nets, this paper proposes a method to transform a given generalized mutual exclusion constraint into an optimal admissible one. Firstly, the uncontrollable subnets are obtained. Secondly, an algorithm for synthesizing the transformed sets of forbidden places is proposed. Lastly, according to the sets of forbidden places, the disjunction of admissible linear constraints which is maximally permissive is constructed. An example is provided to illustrate the efficiency of the proposed method.

Key words: Petri nets, discrete event systems, forbidden states, uncontrolled transitions

中图分类号:

TP391

张丽;赵良煦;王寿光;汪成英. 针对α网的最优线性约束转换方法[J]. J4, 2015, 42(5): 183-187+212.

ZHANG Li;ZHAO Liangxu;WANG Shouguang;WANG Chengying. Optimal linear constraint transformation method for α-nets[J]. J4, 2015, 42(5): 183-187+212.

参考文献

［1］ Yamalidou E, Moody J O, Antsaklis P J, et al. Feedback Control of Petri Nets Based on Place Invariants ［J］. Automatica, 1996, 32(1): 15-28.
［2］ Moody J O, Antsaklis P J. Petri Net Supervisors for DES with Uncontrollable and Unobservable Transitions ［J］ IEEE Transactions on Automatic Control, 2000, 45(3): 462-467.
［3］ Moody J O, Antsaklis P J. Supervisory Control of Discrete Event Systems Using Petri Nets ［M］. New Jersey: Kluwer Academic Publishers, 1998.
［4］ Moody J O, Antsaklis P J, Lemmon M. Feedback Petri Net Control Design in the Presence of Uncontrollable Transition ［C］ //Proceedings of the IEEE 34th Conference on Decision and Control. Piscataway: IEEE,1995: 905-906.
［5］ Basile F, Carbone C, Chiacchio P. Feedback Control Logic for Backward Conflict Free Choice Nets ［J］. IEEE Transactions on Automatic Control, 2007, 52(3): 387-400.
［6］ Basile F, Chiacchio P, Giua A. Suboptimal Supervisory Control of Petri Nets in Presence of Uncontrollable Transitions via Monitor Places ［J］. Automatica, 2006, 42(6): 995-1004.
［7］ Luo J L, Wu W M, Su H Y, et al. Supervisor Synthesis for Enforcing a Class of Generalized Mutual Exclusion Constraints on Petri Nets ［J］. IEEE Transactions on Systems, Man, and Cybernetics-Part A Systems and Humans, 2009, 39(6): 1237-1246.
［8］ Wang S, Wang C, Zhou M. Design of Optimal Monitor-based Supervisors for a Class of Petri Nets with Uncontrollable Transitions ［J］. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2013, 43(5): 1248-1255.
［9］ Luo J, Nonami K, Jin F. Maximally Permissive Supervisor Synthesis Based on a New Constraint Transformation Method ［J］. Automatica, 2012, 48(6): 1097-1101.
［10］ Luo J, Nonami K. Approach for Transforming on Linear Constraints on Petri Nets ［J］. IEEE Transactions on Automatic Control, 2011, 56(11): 2751-2765.
［11］ Wang S, Wang C, Yu Y. Comments on “Siphon-based Deadlock Prevention Policy for Flexible Manufacturing Systems” ［J］. IEEE Transactions on Systems, Man, and Cybernetics-Part A Systems and Humans, 2011, 41(2): 338-340.
［12］ Wang S, Wang C, Zhou M. Controllability Conditions of Resultant Siphons in a Class of Petri Nets ［J］ IEEE Transactions on Systems, Man, and Cybernetics-Part A Systems and Humans, 2012, 42(5): 1206-1215.
［13］ Basile F, Cordone R, Piroddi L. Compact Supervisors for General Constraint Enforcement in Petri Net Models with Uncontrollable Transitions ［C］//European Control Conference. Piscataway: IEEE, 2013: 143-148.
［14］王安荣, 李志武. 基本信标计算的一种快速算法［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.

[1]	王祺;陈晓亮. 一种用于柔性制造系统混惑状态估计的算法[J]. 西安电子科技大学学报, 2017, 44(2): 69-74.
[2]	马子玥;童音. 采用基本标识图的Petri网控制策略[J]. 西安电子科技大学学报, 2016, 43(6): 68-73.
[3]	蒋忠远;张秀艳;马子玥. 智能电网中电能存储系统的容量优化[J]. J4, 2015, 42(6): 106-112.
[4]	张秀艳;钟春富;贾建援. S³PR网的可达标识集算法[J]. J4, 2015, 42(5): 105-109.
[5]	陈晓亮;蒋忠远;叶剑虹 . 工作流网的混或检测和预防策略 [J]. J4, 2015, 42(2): 77-83.
[6]	朱承丞;董利达. 一种多线程软件并发漏洞检测方法 [J]. J4, 2015, 42(2): 167-173+212.
[7]	尤丹;刘苗;吴文慧;王寿光. S³PR网的严格极小信标计算方法[J]. J4, 2014, 41(4): 193-197+204.
[8]	洪良. S³PR网可达标识数的一种有效估算方法[J]. J4, 2014, 41(3): 169-173.
[9]	李晔;王映辉;于振华. 信息物理融合系统的面向对象Petri网建模[J]. J4, 2014, 41(2): 165-171.
[10]	王祺;王安荣;蒲绪强. 制造系统Petri网特殊标识求解算法[J]. J4, 2013, 40(6): 85-91.
[11]	张曼;段振华. 工作流网合成规则及其在流程设计中的应用[J]. J4, 2012, 39(2): 200-206.
[12]	陈玉峰;李志武. 安全Petri网事件分离状态的BDD算法[J]. J4, 2010, 37(1): 119-124+141.
[13]	郭金维;李志武. 一种时延Petri网的死锁预防方法[J]. J4, 2009, 36(5): 902-908.
[14]	朱森;李志武. 双航母编队C³I系统Petri网建模与分析研究[J]. J4, 2009, 36(4): 661-668.
[15]	王安荣;李志武. 基本信标计算的一种快速算法[J]. J4, 2008, 35(4): 632-638.

针对α网的最优线性约束转换方法

Optimal linear constraint transformation method for α-nets

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10