N-Fail-Safe Sequential Machines
- 1 November 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (11) , 1189-1196
- https://doi.org/10.1109/t-c.1972.223476
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Fail-safe realization of sequential machinesInformation and Control, 1973
- N-Fail-Safe Logical SystemsIEEE Transactions on Computers, 1971
- Failsafe Logic NetsIEEE Transactions on Computers, 1971
- Basic Properties and a Construction Method for Fail-Safe Logical SystemsIEEE Transactions on Electronic Computers, 1967