Feedback Control Logic for Backward Conflict Free Choice Nets
Feedback Control Logic for Backward Conflict Free Choice Nets
复制标题
DOI：
10.1109/tac.2007.893969
复制
发表时间：
2007-03
影响因子：
6.8
通讯作者：
F. Basile;C. Carbone;P. Chiacchio
中科院分区：
文献类型：
--
作者：
F. Basile;C. Carbone;P. Chiacchio
本文讨论了广义互斥约束所指定的禁止状态问题，在监督控制的离散事件系统建模的Petri网的背景下。后向冲突的自由和自由选择的不可控的网络的情况下，被认为是如何将这种网络中的良好形成的自由选择网。然后，良好形成的自由选择网分解标记图组件通过递归到最小的T-不变量。禁止状态的问题，从而重新获得标记图组件到一个等价的一个被证明是一个线性规划问题。因此，改进了文献中已有的结果，得到了适合于在线控制的多项式复杂性解。自由选择关系和循环模型，经常出现在现实生活中的情况下，所以允许在不可控子网
This paper discusses the forbidden state problem, as specified by generalized mutual exclusion constraints, in the context of supervisory control of discrete event systems modelled by Petri nets. The case of backward-conflict-free and free-choice uncontrollable subnets is considered and it is shown how to transform such subnets in well-formed free-choice nets. Then, the well-formed free-choice nets are decomposed in marked graph components by recurring to minimal T-invariants. The forbidden state problem is so reformulated for the obtained marked graph components into an equivalent one which is shown to be a linear programming problem. Thus, improving existing results in literature, a polynomial complexity solution, suitable for on-line control, is achieved. Free-choice relationship and cycle modelling, that frequently occur in real-life situations, are so allowed in the uncontrollable subnet