Deadlock avoidance in batch processes using patterns for unsafe states

摘要

Batch processes work on a relatively small number of resources. We propose a minimally restrictive resource allocation policy that is based on necessary conditions for deadlock, some of which are, in the worst case, non-scalable. Marked, colored di-graphs are used to define the processor-=booking problem. An algorithm and an example are included in the paper.