Papers by Keyword: Deadlock Resolution

Abstract: Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadlock zone will be channelized to live markings such that all the dead markings in reachability states will be conserved. Finally, an example is performed and can obtain the maximal permissiveness of a Petri net model. The other examples are all getting the same result. To our knowledge, this is the first work that employs the channelized method to prevent the deadlock problem for FMSs.

Abstract: In the literature only a handful of studies have been performed on the distributed deadlock problem in the generalized request model. Most of those algorithms use either the diffusing computation technique or have the initiator collect all the dependency information among processes. This paper proposes an algorithm which incorporates these two methods with the following properties: first, it removes the reduction phase of the diffusing computation; second, it encodes the dependency information to reduce message length, rather than transmitting it naively as is. The main advantage of the proposed algorithm is that deadlock detection time is reduced to almost half of that of the existing algorithms.