Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems

by: SA Reveliotis, E Roszkowska, JY Choi

Automatic Control, IEEE Transactions on, Vol. 52, No. 12. (2007), pp. 2345-2350.

View FullText article

DOI, IEEE Explore

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

fernand0

Find related articles with these CiteULike tags

avoidance, deadlock, ras, resources

Abstract

<para> 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. </para>

@article{citeulike:2297180, abstract = {<para> 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. </para>}, author = {Reveliotis, S. A. and Roszkowska, E. and Choi, J. Y. }, booktitle = {Automatic Control, IEEE Transactions on}, citeulike-article-id = {2297180}, doi = {10.1109/TAC.2007.910701}, journal = {Automatic Control, IEEE Transactions on}, keywords = {avoidance, deadlock, ras, resources}, number = {12}, pages = {2345--2350}, posted-at = {2008-01-28 10:10:46}, priority = {2}, title = {Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems}, url = {http://dx.doi.org/10.1109/TAC.2007.910701}, volume = {52}, year = {2007} }

RIS record

TY - JOUR ID - citeulike:2297180 L3 - citeulike-article-id:2297180 TI - Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems T2 - Automatic Control, IEEE Transactions on JF - Automatic Control, IEEE Transactions on VL - 52 IS - 12 SP - 2345 EP - 2350 N2 - <para> 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. </para> KW - avoidance KW - deadlock KW - ras KW - resources AU - Reveliotis, SA AU - Roszkowska, E AU - Choi, JY PY - 2007/// UR - http://dx.doi.org/10.1109/TAC.2007.910701 ER -

RIS BibTeX