By Topic

Fault Tolerant Sequential Machines

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

1 Author(s)
Meyer, J.F. ; IEEE

A machine representation of permanent memory faults is introduced where, if M is a sequential machine representing some fault free system, a memory fault is represented by a function μ on the states of M, and the result of the fault by an appropriately determined machine Mμ. Given this representation, the investigation is primarily concerned with faults that are tolerated (masked) in the sense that resulting behavior relates in some specified way to original behavior. Several types of fault masking are thus considered and conditions for their existence investigated. The restriction to a special class of stable faults is also studied, this class being of interest since it includes all faults which correspond to "stuck-at" failures in the memory cells of a sequential switching network.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 10 )