By Topic

A Boolean Model for a Class of 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
$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

1 Author(s)
Robert L. Aveyard ; Bell Telephone Laboratories, Holmdel, N.J. 07733.

A Boolean matrix equation model is obtained for a class of discrete event systems in which the state change associated with each event occurrence is deterministic, and in which all entities are permanent. The Boolean matrix equations are quite compact and can be efficiently programmed on a digital computer. A conveyor system is used as an example. The model can be investigated for determinacy, zero states, and cycles. Algorithms are presented that determine whether transient events interact, and whether transient cycles exist. The zero states of a model are shown to be solutions of a simple Boolean matrix equation.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-4 ,  Issue: 3 )