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.
Nutt, Gary J., "Some Applications of Finite State Automata Theory to the Deadlock Problem ; CU-CS-017-73" (1973). Computer Science Technical Reports. 17.