Deadlocks constitute an important issue to he addressed in the design and operation of flexible manufacturing systems (FMS’s). In this paper, we show that prevention and avoidance of FMS deadlocks can he implemented using Petri net models. For deadlock prevention, we use the reachability graph of a Petri net model of the given FMS, whereas for deadlock avoidance, we propose a Petri net-based on...

The distributed process network (DPN) model allows for greater scalability and performance over a non-distributed process network model. This paper presents a distributed deadlock detection algorithm applicable to process networks. The algorithm efficiently detects both local and global deadlocks. In addition, the deadlock detection algorithm has minimal bandwidth and memory requirements. Lastl...

Deadlocks constitute an important issue to he addressed in the design and operation of flexible manufacturing systems (FMS’s). In this paper, we show that prevention and avoidance of FMS deadlocks can he implemented using Petri net models. For deadlock prevention, we use the reachability graph of a Petri net model of the given FMS, whereas for deadlock avoidance, we propose a Petri net-based on...

Active testing has recently been introduced to effectively test concurrent programs. Active testing works in two phases. It first uses predictive off-the-shelf static or dynamic program analyses to identify potential concurrency bugs, such as data races, deadlocks, and atomicity violations. In the second phase, active testing uses the reports from these predictive analyses to explicitly control...

This work characterizes how various network parameters influence message blocking and deadlocks in irregular networks. Information on blocking behavior is provided that is useful in making design trade-offs between restricting routing freedom and allowing the possibility for deadlocks to form in irregular networks. This paper also identifies ways in which a network’s susceptibility to deadlock ...

Deadlock immunity is a property by which programs, once afflicted by a given deadlock, develop resistance against future occurrences of that and similar deadlocks. We describe a technique that enables programs to automatically gain such immunity without assistance from programmers or users. We implemented the technique for both Java and POSIX threads and evaluated it with several real systems, ...

Deadlock immunity is a property by which programs, once afflicted by a given deadlock, develop resistance against future occurrences of that and similar deadlocks. We describe a technique that enables programs to automatically gain such immunity without assistance from programmers or users. We implemented the technique for both Java and POSIX threads and evaluated it with several real systems, ...

Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This report considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state sp...

Object groups are collections of objects that perform collective work. We study a calculus with object groups and develop a technique for the deadlock analysis of such systems based on abstract descriptions of method’s behaviours.

It is important to analyze and identify potential deadlocks resident in multithreaded programs from a successful deadlock-free execution, because the nondeterministic nature of such programs may hide the errors during testing. Visualizing the runtime behaviors of locking operations makes it possible to debug such errors effectively, because it provides intuitive understanding of different feasi...