Deadlock prevention in flexible manufacturing systems: A verification-free resource configuration approach for liveness of finite-capacity S <sup>3</sup> PR

Deadlock prevention is a critical process in flexible manufacturing systems (FMSs) that ensures the smooth operation of the system and the efficient utilization of resources. A subclass of Petri nets (PNs) named System of Simple Sequential Process with Resources ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> ) is a suitable formalism to model and analyze FMSs. The present study proposes a deadlock prevention approach that ensures the liveness of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> by calculating the minimum initial markings of resource places. First, an equivalent net of a finite-capacity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> has been constructed to describe its capacity function. Next, for the equivalent net, we prove some theorems on its initial markings of resource places under which the liveness of the equivalent net can be ensured. Finally, we develop an algorithm based on integer linear programming (ILP) and the proved theorems to ascertain the minimum necessary resources. Our developed approach can obtain a live net, and it does not need to check the liveness of the obtained marked PN. When compared with previous deadlock work, our approach reduces both facility costs and computational burden. Experimental results on FMSs are provided to validate the effectiveness of the proposed approach.

Authors

Institutions

Publication Details

Journal
Transactions of the Institute of Measurement and Control
Published
2025-09-20
DOI
https://doi.org/10.1177/01423312251369553
Citations
1
Primary Topic
Petri Nets in System Modeling
Type
article
Field-Weighted Citation Impact
1.50
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deadlock prevention in flexible manufacturing systems: A verification-free resource configuration approach for liveness of finite-capacity S 3 PR

Shanchen Pang, Junjie Chen, Hao Yue, Mei Wang et al.
1 citations
Transactions of the Institute of Measurement and Control
Petri Nets in System Modeling
1.50
article

Deadlock prevention in flexible manufacturing systems: A verification-free resource configuration approach for liveness of finite-capacity S 3 PR

Shanchen Pang, Junjie Chen, Hao Yue, Mei Wang, Liqi Wan
article en
1 citations

Abstract

Deadlock prevention is a critical process in flexible manufacturing systems (FMSs) that ensures the smooth operation of the system and the efficient utilization of resources. A subclass of Petri nets (PNs) named System of Simple Sequential Process with Resources ( <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> ) is a suitable formalism to model and analyze FMSs. The present study proposes a deadlock prevention approach that ensures the liveness of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> by calculating the minimum initial markings of resource places. First, an equivalent net of a finite-capacity <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"> <mml:mrow> <mml:msup> <mml:mrow> <mml:mi mathvariant="normal">S</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msup> <mml:mi mathvariant="normal">PR</mml:mi> </mml:mrow> </mml:math> has been constructed to describe its capacity function. Next, for the equivalent net, we prove some theorems on its initial markings of resource places under which the liveness of the equivalent net can be ensured. Finally, we develop an algorithm based on integer linear programming (ILP) and the proved theorems to ascertain the minimum necessary resources. Our developed approach can obtain a live net, and it does not need to check the liveness of the obtained marked PN. When compared with previous deadlock work, our approach reduces both facility costs and computational burden. Experimental results on FMSs are provided to validate the effectiveness of the proposed approach.

Transactions of the Institute of Measurement and Control
State Administration of Work Safety (CN), Oil and Gas Center (CN), State Key Laboratory of Chemical Engineering (CN), China University of Petroleum, East China (CN), Yangzhou University (CN)
Openalex Percentile: Top 13%
Petri Nets in System Modeling
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.