On near-optimal deadlock control for a class of generalized Petri nets using reachability graph. Issue 6 (7th August 2017)
- Record Type:
- Journal Article
- Title:
- On near-optimal deadlock control for a class of generalized Petri nets using reachability graph. Issue 6 (7th August 2017)
- Main Title:
- On near-optimal deadlock control for a class of generalized Petri nets using reachability graph
- Authors:
- Hou, YiFan
Uzam, Murat
Zhao, Mi
Li, ZhiWu - Abstract:
- Abstract : Purpose: Deadlock is a rather undesirable phenomenon and must be well solved in flexible manufacturing systems (FMS). This paper aims to propose a general iterative deadlock control method for a class of generalized Petri nets (GPN), namely, G-systems, which can model an FMS with assembly and disassembly operations of multiple resource acquisition. When given an uncontrolled G-system prone to deadlocks, the work focuses on the synthesis of a near-optimal, non-blocking supervisor based on reachability graph (RG) analysis. Design/methodology/approach: The concept of a global idle place (GIP) for an original uncontrolled G-system is presented. To simplify the RG computation of an uncontrolled G-system, a GIP is added temporarily to the net model during monitor computation steps. Starting with one token and then by gradually increasing the number of tokens in the GIP at each iteration step, the related net system is obtained. The minimal-covered-set of all bad markings of the related net system suffering from deadlock can be identified and then removed by additional monitors through an established place-invariant control method. Consequently, all related systems are live, and the GIP is finally removed when the non-blockingness of the controlled system is achieved. Meanwhile, the redundancy of monitors is also checked. Findings: A typical G-system example is provided to demonstrate the applicability and effectiveness of the proposed method. Experiments show that theAbstract : Purpose: Deadlock is a rather undesirable phenomenon and must be well solved in flexible manufacturing systems (FMS). This paper aims to propose a general iterative deadlock control method for a class of generalized Petri nets (GPN), namely, G-systems, which can model an FMS with assembly and disassembly operations of multiple resource acquisition. When given an uncontrolled G-system prone to deadlocks, the work focuses on the synthesis of a near-optimal, non-blocking supervisor based on reachability graph (RG) analysis. Design/methodology/approach: The concept of a global idle place (GIP) for an original uncontrolled G-system is presented. To simplify the RG computation of an uncontrolled G-system, a GIP is added temporarily to the net model during monitor computation steps. Starting with one token and then by gradually increasing the number of tokens in the GIP at each iteration step, the related net system is obtained. The minimal-covered-set of all bad markings of the related net system suffering from deadlock can be identified and then removed by additional monitors through an established place-invariant control method. Consequently, all related systems are live, and the GIP is finally removed when the non-blockingness of the controlled system is achieved. Meanwhile, the redundancy of monitors is also checked. Findings: A typical G-system example is provided to demonstrate the applicability and effectiveness of the proposed method. Experiments show that the proposed method is easy to use and provides very high behavioral permissiveness for G-system. Generally, it can achieve an optimal or a near-optimal solution of the non-blocking supervisor. Originality/value: In this work, the concept of GIP for G-systems is presented for synthesis non-blocking supervisors based on RG analysis. By using GIP, an effective deadlock control method is proposed. Generally, the proposed method can achieve an optimal or a near-optimal, non-blocking supervisor for an uncontrolled G-system prone to deadlocks. … (more)
- Is Part Of:
- Engineering computations. Volume 34:Issue 6(2017)
- Journal:
- Engineering computations
- Issue:
- Volume 34:Issue 6(2017)
- Issue Display:
- Volume 34, Issue 6 (2017)
- Year:
- 2017
- Volume:
- 34
- Issue:
- 6
- Issue Sort Value:
- 2017-0034-0006-0000
- Page Start:
- 1896
- Page End:
- 1922
- Publication Date:
- 2017-08-07
- Subjects:
- Petri net -- FMS -- Deadlock prevention -- Non-blockingness -- Reachability graph
Computer-aided engineering -- Periodicals
Computer graphics -- Periodicals
620.00285 - Journal URLs:
- http://info.emeraldinsight.com/products/journals/journals.htm?id=ec ↗
http://www.emeraldinsight.com/journals.htm?issn=0264-4401 ↗
http://www.emeraldinsight.com/0264-4401.htm ↗
http://www.emeraldinsight.com/ ↗
http://firstsearch.oclc.org ↗ - DOI:
- 10.1108/EC-03-2016-0091 ↗
- Languages:
- English
- ISSNs:
- 0264-4401
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 3758.580800
British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 4401.xml