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

Zhiwu Li, Mengchu Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009
Pages608-613
Number of pages6
DOIs
StatePublished - Sep 21 2009
Event2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009 - Okayama, Japan
Duration: Mar 26 2009Mar 29 2009

Other

Other2009 IEEE International Conference on Networking, Sensing and Control, ICNSC 2009
CountryJapan
CityOkayama
Period3/26/093/29/09

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A polynomial-complexity approach to decide the existence of a maximally permissive Petri net supervisor using elementary siphons'. Together they form a unique fingerprint.

Cite this