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

Content Provider	IEEE Xplore Digital Library
Author	ZhiWu Li Ding Liu
Copyright Year	2005
Description	Author affiliation: School of Electro-Mechanical Engineering Xidian University, Xi'an 710071 China E-mail: zhwli@xidian.edu.cn (ZhiWu Li)
Abstract	In this paper, we extend the liveness characterization results on a subclass of Petri nets, $L-S^{3}PR.$ A polynomial algorithm is developed to decide whether a more general class of Petri nets, $S^{3}PR,$ has potential deadlock, which can model a wide class of flexible manufacturing systems. First, the definitions of $L-S^{3}PR$ and S3PR are presented with illustrations. Then the concept of resource circuits and the way to find them from a net structure are proposed. We show the approach to obtain a minimal siphon S from a resource circuit. It is also proved that if a minimal siphon derived from a resource circuit does not contain the support of any P-invariant, it is not a potential deadlock. A minimal siphon that can be emptied is the real cause of the non-liveness in an $S^{3}PR.$ Finally, an example is given to illustrate our results.
Starting Page	1155
Ending Page	1157
File Size	360403
Page Count	3
File Format	PDF
ISBN	0780391373
DOI	10.1109/ICCA.2005.1528296
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-06-26
Publisher Place	Hungary
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Petri nets System recovery Circuits Flexible manufacturing systems Power system modeling Sufficient conditions Manufacturing systems Graph theory Bandwidth
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

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

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

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

A new liveness characterization for S3PGR2

A fast algorithm to find a set of elementary siphons for a class of petri nets

A class of Petri nets and a reachability problem solvable in deterministic polynomial time

A hierarchical modeling methodology for flexible manufacturing systems using extended Petri nets

Monitor-based liveness-enforcing petri net supervisors for flexible manufacturing systems

A method for verifying deadlock freedom and liveness of petri nets

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

Similar Documents

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

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

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

A new liveness characterization for S3PGR2

A fast algorithm to find a set of elementary siphons for a class of petri nets

A class of Petri nets and a reachability problem solvable in deterministic polynomial time

A hierarchical modeling methodology for flexible manufacturing systems using extended Petri nets

Monitor-based liveness-enforcing petri net supervisors for flexible manufacturing systems

A method for verifying deadlock freedom and liveness of petri nets

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