CAJ | 학술논문

针对不可控影响子网为α网的一类Petri网，提出了将给定的广义互斥约束转换成最优允许线性约束的方法。该方法首先获得了该网的不可控影响子网；其次，提出了转换后的禁止库所集集合的求解算法；最后，根据禁止库所集集合构造了“逻辑或”形式的最大允许线性约束。并且通过一个例子，说明了该方法的有效性。
침대불가공영향자망위α망적일류Petri망，제출료장급정적엄의호척약속전환성최우윤허선성약속적방법。해방법수선획득료해망적불가공영향자망；기차，제출료전환후적금지고소집집합적구해산법；최후，근거금지고소집집합구조료“라집혹”형식적최대윤허선성약속。병차통과일개례자，설명료해방법적유효성。
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 .