Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case

@article{Nazeem2011DesigningCA,
  title={Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case},
  author={Ahmed Nazeem and Spyros A. Reveliotis and Yin Wang and St{\'e}phane Lafortune},
  journal={IEEE Transactions on Automatic Control},
  year={2011},
  volume={56},
  pages={1818-1833}
}
Most of the past research on the problem of deadlock avoidance for complex resource allocation systems (RAS) has acknowledged the fact that the computation of the maximally permissive deadlock avoidance policy (DAP) possesses super-polynomial complexity for most RAS classes, and therefore, it has resorted to solutions that trade off maximal permissiveness for computational tractability. In this paper, we distinguish between the off-line and the on-line computation that is required for the… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS
41 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

77 Citations

0102030'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…