By Topic

Finite buffer realization of input-output discrete-event 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

3 Author(s)
Kumar, R. ; Dept. of Electr. Eng., Kentucky Univ., Lexington, KY, USA ; Garg, V.K. ; Marcus, S.I.

Many discrete-event systems (DES's), such as manufacturing systems, database management systems, communication networks, traffic systems, etc., can be modeled as input-output discrete-event systems (I/O DES's). In this paper we formulate and study the problem of stable realization of such systems in the logical setting. Given an input and an output language describing the sequences of events that occur at the input and output, respectively, of an I/O DES, we study whether it is possible to realize the system as a unit consisting of a given set of buffers of finite capacity, called a dispatching unit. The notions of stable, conditionally stable, dispatchable and conditionally dispatchable units are introduced as existence of stable (or input-output bounded), and causal (or prefix preserving) input-output maps, and effectively computable necessary and sufficient conditions for testing them are obtained

Published in:

Automatic Control, IEEE Transactions on  (Volume:40 ,  Issue: 6 )