PART B : LITERATURE REVIEW ON DEADLOCK RECOVERY TECHNIQUES
●
Based on a recent peer-reviewed project.
Reviewed Literature
●
●
●
Design of a Novel Transition-Based Deadlock Recovery Policy for flexible Manufacturing
systems.
Chaung et al ., 2025
Processes (MDPI)
Research Motivation
●
●
●
Deadlocks reduce productivity in shared- resource systems.
Prevention methods reduce flexibility.
This study focuses on recovery after deadlock occurs.
Literature review Methodology / Recovery Techniques Explained.
Petri Net systems:
Are formal and graphical modeling tool used to describe, analyze and control systems that
involve concurrency, synchronization, resource sharing and conflict.
Basics of Petri Net system
● Places (P)- represents conditions or resources
● Transition (T)- represents events or actions
● Token- represents the current state of the system.
● Arcs- Connect places to transitions and transitions to places
Deadlock Revovery with Petri Nets
● Transition Rollback
– Reverse certain transitions
– Return tokens to previous places
●
Resource Preemtion
Force removal of tokens from resources holding places
Free resources for other transitions.
●
Controlled Transition Firing
Introduces special recovery transitions
Activated only in deadlock markings
Move system back to safe state
–
–
–
–
–
Advantages of Petri nets for Deadlock recovery
● Formal mathematical foundation
● Graphical visualization of deadlock states.
●
Can model complex, concurrent systems.
Resource Flow Graphs
Is a simplified graphical model used to represent resource allocation, requests and
dependencies among processes.
Basics of RFG
● Process Nodes (P)- Represents active processes
● Resource Nodes (R) - represents system resources.
● Directed Edges
– Request Edge- process is requesting a resource
– Assignment edge- Resource is allocated to a process
RFG Recovery Techniques
● Process Termination
– Abort one or more processes in the cycle
– Resources are released
– Cycle is broken
●
Resource Preemption
Temporarily take resources from a process
Reassign them to another process
Update the RFG by reversing assignment edges.
●
Rollback and Restart
Process state is restored to a safe state check point
Resource requests are cancelled
Corresponding request edges are removed
–
–
–
–
–
–
Circular wait detection
Focuses on identifying one of the four necessary deadlock conditions.
Circular wait where a set of processes are waiting for resources held by one another in a
closed chain.
Deadlock Rcovery techniques in Circular Wait
Detection alone does not resolve deadlock, it triggers recovery.
●
Process Termination
Abort one or more processes in the cycle
Breaks the circular wait
●
Resource Preemption
Temporarily take a resource from a process
–
–
–
–
–
Assign it to another process
Removes dependency edges
●
Rollback to checkpoint
Restore to safe state
Release resources
Cancel pending request
–
–
–
Key Contributions
●
●
●
Maintains maximal permissiveness
Improves system liveness
Validated using manufacturing case study
Significance
●
●
●
Recovery- focused approach
Combines theory and real world application
Relevant to automated and concurrent systems.
Conclusion
●
●
Demonstrates effective modern deadlock recovery
Shows advantages over traditional prevention methods
Reference
●
●
Chuang, W, -Y., Tseng, C, -Y., Tan , K, -H., & Pan , Y,-L. (2025)
Process, 13(5), 1610