By Topic

Realization of Fault-Tolerant and Fail-Safe 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

6 Author(s)
Gupta, A.Sen ; Computer Centre, University of Calcutta, Calcutta, India. ; Chattopadhyay, D.K. ; Palit, A. ; Bandyopadhyay, A.K.
more authors

Given a synchronous sequential machine M, this correspondence deals with the fault-tolerant realization M¿ of M and also its fail-safe realization M¿ on the assumption that the faults that can occur to the circuitry of M¿ or M¿ are of permanent stuck-at type and the total number of faults can be at most some preset positive integer r. First, the realization of M¿ or M¿ is derived for r = 1 and then the same idea is extended to have the realization for any arbitrary r. It has been shown that the realization of M¿ is such that it is also able to tolerate faults of nonpermanent nature.

Published in:

Computers, IEEE Transactions on  (Volume:C-26 ,  Issue: 1 )