Deadlock avoidance policies for resource allocation systems with applications to FMS

Placid Mathew Ferreira, M. A. Lawley, S. A. Reveliotis

Research output: Contribution to conferencePaper

Abstract

The problem of deadlock avoidance for a class of Resource Allocation Systems (RAS) called the Single-Unit RAS (SU-RAS) is discussed with particular application to buffer space allocation in a Flexible Manufacturing System. For a class of SU-RAS, it is shown that the problem of obtaining the maximally permissive deadlock avoidance policy is of polynomial complexity. Suboptimal policies (which are not maximally permissive) for SU-RAS are also discussed.

Original languageEnglish (US)
Pages42-48
Number of pages7
StatePublished - Dec 1 1996
EventProceedings of the 1996 IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96. Part 2 (of 2) - Kauai, HI, USA
Duration: Nov 18 1996Nov 21 1996

Other

OtherProceedings of the 1996 IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96. Part 2 (of 2)
CityKauai, HI, USA
Period11/18/9611/21/96

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Deadlock avoidance policies for resource allocation systems with applications to FMS'. Together they form a unique fingerprint.

  • Cite this

    Ferreira, P. M., Lawley, M. A., & Reveliotis, S. A. (1996). Deadlock avoidance policies for resource allocation systems with applications to FMS. 42-48. Paper presented at Proceedings of the 1996 IEEE Conference on Emerging Technologies and Factory Automation, ETFA'96. Part 2 (of 2), Kauai, HI, USA, .