Some Applications of Finite State Automata Theory to the Deadlock Problem ; CU-CS-017-73
Gary J Nutt · CU Scholar (University of Colorado Boulder) · 1973
A new characterization of the system deadlock problem is presented in which sequences of resource activity are treated as potential members of the set of strings accepted by a finite state automation. Membership in the set indicates a deadlock situation. A detection algorithm and an avoidance algorithm are provided to illustrate the approach. Some new areas of research based on the ideas are briefly mentioned.