Positive Fail-Safe Realization of Synchronous Sequential Machines
Halatsis, Gaitanis · IEEE Transactions on Computers · 1979
The correspondence deals with the fail-safe realization of synchronous sequential machines under the assumption that the next-state functions are in any positive form. This leads to new classes of assignments called positive fail-safe assignment's (PFSA) The feasibility conditions of such assignments are given and systematic procedures are presented for deriving them using k-out-of-n codes.