Deadlock Analysis of Petri Nets Based on the Resource Share Places Relationship

The Deadlock problem in FMS, occurred by the relationship between more than two operations based on the resource share machines or robots, and buffers. Since a deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop, it is very important to detect and prevent a deadlock. In this paper, we study the problem of deadlock detection and avoidance by using the PN model based on the relationship of the resource share places for FMS (Flexible Management System). Also, we propose a deadlock detection conditions after analyzed the Petri Net used the transitive matrix. For presenting the results, the suggested deadlock detection and avoidance algorithms were also adapted to an illustrated model.