Optimal Petri net supervisor synthesis for forbidden state problems using marking mask
Optimal Petri net supervisor synthesis for forbidden state problems using marking mask
复制标题
DOI：
10.1016/j.ins.2019.07.008
复制
发表时间：
2019-07
期刊：
影响因子：
--
通讯作者：
Yuting Li;Li Yin;Yufeng Chen;Zhenhua Yu;N. Wu
中科院分区：
文献类型：
--
作者：
Yuting Li;Li Yin;Yufeng Chen;Zhenhua Yu;N. Wu
本文讨论了Petri网建模的离散事件系统（DES）中的禁止状态问题。给定一个控制规范，我们首先确定禁止和允许标记的集合。然后，利用植物中一类特殊位置（称为竞争位置）实现的标记掩码，计算首遇禁止标记（FFM）的最小掩码集和容许标记的最小根集.标记掩模可以有效地过滤待处理的标记，使得所获得的两个集合通常分别比最初指定的禁止标记和允许标记的集合小得多。利用位置不变量计算出的最小值来禁止禁止标记。它示出了一个最大许可（最佳）的监督，如果它存在，可以计算。用非线性规划方法对监控器的结构进行优化。FFM的最小掩码集和允许标记的根集有效地减少了计算开销，因为在公式化的规划问题中的约束和变量少得多。参数化的例子说明了所开发的方法。
This article addresses the forbidden state problem in discrete-event systems (DESs) modeled with Petri nets. Given a control specification, we first decide the sets of forbidden and admissible markings. Then, the minimal mask set of first-met forbidden markings (FFMs) and the minimal root set of admissible markings are computed by marking mask that is implemented using a class of special places in a plant, called competitive places. Marking mask can effectively filtrate the markings to be processed such that the two obtained sets are in general much smaller than the sets of originally specified forbidden and admissible markings, respectively. Monitors computed by place invariants are used to forbid the forbidden markings. It is shown that a maximally permissive (optimal) supervisor can be computed if it exists. Integer linear programming is used to optimize the structure of a supervisor. The minimal mask set of FFMs and root set of admissible markings efficiently reduce the computational overhead because of much fewer constraints and variables in the formulated programming problem. The developed methodology is illustrated by parameterized examples.