− A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in many special systems, DFU states do not exist and polynomial deadlock avoidance policy (DAP) using one-step look ahead algorithms can avoid deadlock states. This paper first establishes the NP-completeness on determining the exist...

We present an analysis for deadlock avoidance in manufacturing Flow-lines (FMRF). In FMRF, shared resources are not dedicated for certain jobs; choices in reentrant flow lines, i.e. routing decisions to be made. A Discrete Ev avoidance dispatching, which framework uses a rule-based matrix formulation, is u systems. The development of deadlock-free dispatching rules is derived from circu blockin...

We propose a framework for building deadlock-free systems from deadlock-free components. The framework is based on a methodology for the layered construction of systems by superposing three layers. A layer of components, an interaction model and a restriction layer. The interaction model specifies the possible interactions between components. The restriction layer restricts the behavior of the ...

Deadlock-free operation is a principal requirement for an automated manufacturing system. The part types passing through the manufacturing system are characterized by the sequence of the manufacturing resources required for their completion. The method partitions the sequence into alternate subsequences consisting of deadlock-free resources and deadlock-risk resources. The set of deadlock-free ...

We build upon established techniques of deadlock analysis by formulating a new sound but incomplete framework for deadlock freedom analysis that tackles some sources of imprecision of current incomplete techniques. Our new deadlock candidate criterion is based on constraints derived from the analysis of the state space of pairs of components. This new characterisation represents an improvement ...

Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking are provided. An optimization algorithm is presented for nding deadlock-free capacity assignments with the least tot...

Timing an unforced (discrete or continuous) net model preserves deadlock-freeness, but not the stronger liveness property, in general. The converse is not true, and if the autonomous net model has deadlocks, the timing may transform it into deadlock-free. Under infinite servers semantics, here we investigate the conditions on the firing rates of continuous timed models that makes deadlock-free ...

Configuration flexibility and deadlock-free operation are two essential properties of control systems for highly automated flexible manufacturing systems. Configuration flexibility, the ability to quickly modify manufacturing system components and their logical relationships, requires automatic generation of control executables from high level system specifications. These control executables mu...