Reports

 

Some Applications of Finite State Automata Theory to the Deadlock Problem ; CU-CS-017-73 Public Deposited

https://scholar.colorado.edu/concern/reports/tm70mv98f
Abstract
  • 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.
Creator
Date Issued
  • 1973-04-01
Academic Affiliation
Last Modified
  • 2019-12-21
Resource Type
Rights Statement
Language

Relationships

Items