This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condit...This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condition is given and proven for the existence of a feasible priority-based controller based on the notions of liveness and transition invariants. Next, a cyclic behavior graph is constructed, which shows the reachable markings that guarantee the maximum liveness of the system within a given bound vector. Finally, an on-line control strategy is proposed to enforce boundedness and liveness to the given system by appending priority relations to transitions. The dynamic priority relation changes flexibly according to the current state of the system and enforces the system evolving in a bounded and live manner. In addition, numerical examples are studied to verify the validity of the proposed approach that remains the structure of the plant net and is efficient for on-line control.展开更多
基金the Project of Industrial Internet and Integration of Industrialization and Industrialization of Guangxi,China under Grant No.Guigong2021-37.
文摘This paper deals with the supervisory control problem of discrete event systems modeled by labeled Petri nets. The system is originally unbounded. First, the solvability of the problem is confirmed. A necessary condition is given and proven for the existence of a feasible priority-based controller based on the notions of liveness and transition invariants. Next, a cyclic behavior graph is constructed, which shows the reachable markings that guarantee the maximum liveness of the system within a given bound vector. Finally, an on-line control strategy is proposed to enforce boundedness and liveness to the given system by appending priority relations to transitions. The dynamic priority relation changes flexibly according to the current state of the system and enforces the system evolving in a bounded and live manner. In addition, numerical examples are studied to verify the validity of the proposed approach that remains the structure of the plant net and is efficient for on-line control.
