By Topic

Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Reveliotis, S.A. ; Georgia Inst. of Technol., Atlanta ; Roszkowska, E. ; Choi, J.Y.

Currently, one of the most actively researched approaches regarding the design of deadlock avoidance policies for sequential resource allocation systems is based on concepts and techniques provided by the, so called, theory of regions, that addresses the broader problem of synthesizing PN models with prespecified behaviors. However, one limitation of the theory of regions and its aforementioned derivatives is that they cannot be applied when the target behavior has a nonconvex representation in the underlying state space. In this note, we show how this problem can be circumvented by appropriately generalizing the employed class of the candidate policies.

Published in:

Automatic Control, IEEE Transactions on  (Volume:52 ,  Issue: 12 )