By Topic

Efficient implementation of fairness in discrete-event systems using queues

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)
Gohari, P. ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada ; Wonham, W.M.

Fair synthesis of supervisory control for discrete-event systems is discussed. It is argued that a least restrictive supervisor does not in general exist unless a bound is placed on the number of transitions before which a desired event is required to happen. It is shown how such bounded fairness can be implemented using first-input-first-output (FIFO) queues. Although the language generated by a queue is not the largest among bounded fair restrictions of a behavior, nonoptimality can be exploited in hierarchical implementation of queues by grouping a subset of subsystems as a team and designing two modular queues: one to implement fairness locally among the team members, and the other to implement fairness globally between the team and other subsystems.

Published in:

Automatic Control, IEEE Transactions on  (Volume:50 ,  Issue: 11 )