By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

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

2 Author(s)
Jonghun Park ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Reveliotis, S.A.

Deadlock avoidance in sequential resource allocation systems is a well-defined 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 finite-state automata (FSA) and Petri nets (PNs). In this paper, it is shown that a significant class of deadlock avoidance policies (DAPs), known as algebraic polynomial kernel (PK)-DAPs, originally developed in the FSA paradigm, can be analyzed using recent results from PN structural analysis. Furthermore, the approach to DAP analysis and design taken in this paper has led to the effective generalization of the currently available algebraic PK-DAPs, and to their enrichment with new and more flexible policy implementations

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:16 ,  Issue: 2 )