By Topic

N-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

2 Author(s)
Takaoka, T. ; Electrical Communication Laboratories, Nippon Telegraph and Telephone Public Corporation ; Ibaraki, T.

Let S be a sequential machine with binary (i. e., 0 or 1) input and binary output. Suppose that the third value N, different from 0 and 1, represents the faulty input or output value. An N-fail-safe (NFS) machine S̄ of S is then defined as a sequential machine with ternary (i.e., 0, 1, or N) input and ternary output such that: 1) S is a submachine of S̄, and 2) possible output failures of S̄ are 0→N or 1→ N for any input failures 0→N or 1→N. This machine may be considered "fail-safe" since no failure such as 0→1 or 1→0 occurs in the output.

Published in:

Computers, IEEE Transactions on  (Volume:C-21 ,  Issue: 11 )