TY - GEN
T1 - Near-optimal and minimal PN supervisors of FMS with uncontrollability and unobservability
AU - Huang, Bo
AU - Pei, Yan Dong
AU - Yang, Yu Wang
AU - Zhou, Meng Chu
AU - Li, Jian Qiang
N1 - Funding Information:
This work was supported in part by National Natural Science Foundation of China under Grants 61773206 and 61640020, Primary Research & Development Plan of JiangSu Province of China under Grant SBE2015000792, Natural Science Foundation of Jiangsu Province under Grant BK20170131, and China National Key Technology Research and Development Program Project under Grant 2015BAH13F01.
Publisher Copyright:
© 2017 IEEE.
PY - 2017/11/27
Y1 - 2017/11/27
N2 - For flexible manufacturing systems, this paper presents a Petri net based deadlock prevention method to obtain highly permissive and structurally minimal supervisors in the presence of uncontrollable and unobservable transitions. First, we define admissible markings which form a maximal strongly connected component (SCC) containing the initial marking and not leading outside the SCC uncontrollably. Then, an integer linear programming problem is formulated to construct a supervisor which permits all admissible markings and forbids all the very first inadmissible states from the admissible zone. It also ensures that no uncontrollable transitions are controlled and no unobservable ones are observed by the supervisor. The method can be applied to the plant nets whose crucial transitions are uncontrollable and/or unobservable. In addition, the obtained supervisors are deadlock-free, highly permissive, and structurally minimal in the presence of controllability and observability.
AB - For flexible manufacturing systems, this paper presents a Petri net based deadlock prevention method to obtain highly permissive and structurally minimal supervisors in the presence of uncontrollable and unobservable transitions. First, we define admissible markings which form a maximal strongly connected component (SCC) containing the initial marking and not leading outside the SCC uncontrollably. Then, an integer linear programming problem is formulated to construct a supervisor which permits all admissible markings and forbids all the very first inadmissible states from the admissible zone. It also ensures that no uncontrollable transitions are controlled and no unobservable ones are observed by the supervisor. The method can be applied to the plant nets whose crucial transitions are uncontrollable and/or unobservable. In addition, the obtained supervisors are deadlock-free, highly permissive, and structurally minimal in the presence of controllability and observability.
UR - http://www.scopus.com/inward/record.url?scp=85044369024&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85044369024&partnerID=8YFLogxK
U2 - 10.1109/SMC.2017.8123211
DO - 10.1109/SMC.2017.8123211
M3 - Conference contribution
AN - SCOPUS:85044369024
T3 - 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017
SP - 3715
EP - 3720
BT - 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2017
Y2 - 5 October 2017 through 8 October 2017
ER -