This paper considers deadlock detection problem for FMS (Flexible Management System) based on the relationship of the resource share places in Petri Nets model. 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, after analyzing the relation of resource-share places in Petri Nets, we study the deadlock condition in FMS. This paper intends to review and compare these deadlock detection and avoidance methods based on the complexity, the effect value and the algorithm understanding.
avoidance, benchmark, DAPN, deadlock, Petri-nets, resource sharing, siphon, transitive matrix