Algebraic synthesis of efficient deadlock avoidance policies for sequential resource allocation systems


Deadlock avoidance in sequential resource allocation systems is a well-deened problem in Discrete Event System literature, as it underlies the operation of many contemporary technological systems. In the past, the problem has been studied by means of a number of formal frameworks, including the nite state automata (FSA) and Petri nets (PN). In this paper… (More)
DOI: 10.1109/70.843175


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

82 Citations

Semantic Scholar estimates that this publication has 82 citations based on the available data.

See our FAQ for additional information.