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

Content Provider	IEEE Xplore Digital Library
Author	Zhiwu Li MengChu Zhou
Copyright Year	2009
Description	Author affiliation: Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, 07102, USA (MengChu Zhou) \|\| School of Electro-Mechanical Engineering, Xidian University, Xi'an 710071, China (Zhiwu Li)
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, $S^{3}PR$ 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 $S^{3}PR$ in our previous work, which has been shown to be of polynomial complexity with respect to the size of an $S^{3}PR.$
Starting Page	608
Ending Page	613
File Size	1972296
Page Count	6
File Format	PDF
ISBN	9781424434916
DOI	10.1109/ICNSC.2009.4919347
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-03-26
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Petri nets Automata Formal languages Network synthesis Specification languages Automatic control System recovery Resource management Power system modeling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Existence of a Maximally Permissive Liveness-enforcing Petri Net Supervisor for Flexible Manufacturing Systems

Optimal controllability of 3-composed siphons in a class of Petri nets

A polynomial algorithm to find a set of elementary siphons in a class of Petri nets

Maximally permissive deadlock prevention policy for FMS based on elementary siphons

A polynomial complexity algorithm to decide the liveness for a class of Petri nets

A Polynomial Complexity Algorithm to Decide the Liveness for a Class of Petri Nets

Some results and open problems concerning elementary siphons of Petri nets

Maximally permissive deadlock prevention policy for FMS based on siphons

A deadlock prevention policy for a class of Petri nets $S^{3}PMR$ based on elementary siphons

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

Similar Documents

On the Existence of a Maximally Permissive Liveness-enforcing Petri Net Supervisor for Flexible Manufacturing Systems

Optimal controllability of 3-composed siphons in a class of Petri nets

A polynomial algorithm to find a set of elementary siphons in a class of Petri nets

Maximally permissive deadlock prevention policy for FMS based on elementary siphons

A polynomial complexity algorithm to decide the liveness for a class of Petri nets

A Polynomial Complexity Algorithm to Decide the Liveness for a Class of Petri Nets

Some results and open problems concerning elementary siphons of Petri nets

Maximally permissive deadlock prevention policy for FMS based on siphons

A deadlock prevention policy for a class of Petri nets $S^{3}PMR$ based on elementary siphons

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