By Topic

Liveness-enforcing supervision for resource allocation systems with uncontrollable behavior and forbidden states

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
$33 $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)
J. Park ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; S. A. Reveliotis

Although liveness enforcing supervision (LES) of sequential resource allocation systems (RAS) is currently a well-established problem in the Discrete Event System literature, all prior work on it has addressed the underlying LES synthesis problem under the assumption that the system behavior is totally controllable. The work presented in this paper seeks to develop correct and scaleable LES for RAS that present uncontrollability with respect to: 1) the timing of some requested resource allocations, i.e., these allocations will take place as long as the requested resources are available and/or 2) the routing of certain job instances that, after some processing stages, might request special treatment or rework. In addition, the last part of the paper addresses the accommodation in the original LES synthesis problem of externally imposed logical constraints, that constitute "forbidden state" specifications and possess a linear characterization with respect to the system resource allocation state. All problems are addressed in the context of Conjunctive/Disjunctive (CD)-RAS, that constitutes one of the broadest RAS classes. investigated in the literature, allowing for arbitrarily structured resource allocations associated with the various process stages, and process routing flexibility

Published in:

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