TY - GEN

T1 - A polynomial-complexity approach to decide the existence of a maximally permissive Petri net supervisor using elementary siphons

AU - Li, Zhiwu

AU - Zhou, Meng Chu

PY - 2009

Y1 - 2009

N2 - Liveness is usually enforced by designing a supervisor that is supervisory in nature disabling events which otherwise would lead to the violation of the liveness specification. The supervisor is theoretically and practically expected to be maximally permissive such that it restricts the behavior of the plant (system under control) in a least restrictive manner while the liveness specification is not violated. However, the existence of a supervisory policy that enforces liveness in an arbitrary Petri net is undecidable. Based on elementary siphons of Petri nets, we develop a polynomial complexity approach to decide the existence of a maximally permissive monitorbased liveness-enforcing Petri net supervisor for a subclass of Petri nets, S3PR that can well model a large class of flexible manufacturing systems. The results obtained in this paper are based on the computation of the set of elementary siphons and siphon composition operations in an S3PR in our previous work, which has been shown to be of polynomial complexity with respect to the size of an S3PR.

AB - Liveness is usually enforced by designing a supervisor that is supervisory in nature disabling events which otherwise would lead to the violation of the liveness specification. The supervisor is theoretically and practically expected to be maximally permissive such that it restricts the behavior of the plant (system under control) in a least restrictive manner while the liveness specification is not violated. However, the existence of a supervisory policy that enforces liveness in an arbitrary Petri net is undecidable. Based on elementary siphons of Petri nets, we develop a polynomial complexity approach to decide the existence of a maximally permissive monitorbased liveness-enforcing Petri net supervisor for a subclass of Petri nets, S3PR that can well model a large class of flexible manufacturing systems. The results obtained in this paper are based on the computation of the set of elementary siphons and siphon composition operations in an S3PR in our previous work, which has been shown to be of polynomial complexity with respect to the size of an S3PR.

UR - http://www.scopus.com/inward/record.url?scp=70349140520&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349140520&partnerID=8YFLogxK

U2 - 10.1109/ICNSC.2009.4919347

DO - 10.1109/ICNSC.2009.4919347

M3 - Conference contribution

AN - SCOPUS:70349140520

SN - 9781424434923

T3 - Proceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009

SP - 608

EP - 613

BT - Proceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009

T2 - 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009

Y2 - 26 March 2009 through 29 March 2009

ER -