Fail-Safe Asynchronous Machines with Multiple-Input Changes
- 1 June 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-25 (6) , 637-642
- https://doi.org/10.1109/TC.1976.1674664
Abstract
Several synthesis methods for fail-safe asynchronous sequential machines have been reported recently. All of these methods solve the race problem by using noncritical race state assignments. This approach generally results in large number of state variables, relatively complicated design, and the limitation of single-input change.Keywords
This publication has 13 references indexed in Scilit:
- Design of Fail-Safe Sequential Machines Using Separable CodesIEEE Transactions on Computers, 1978
- Fail-Safe Asynchronous Sequential MachinesIEEE Transactions on Computers, 1975
- Design of Reliable Synchronous Sequential CircuitsIEEE Transactions on Computers, 1975
- Design Technique of Fail-Safe Sequential Circuits Using Flip-Flops For Internal MemoryIEEE Transactions on Computers, 1974
- A Method for the Realization of Fail-Safe Asynchronous Sequential CircuitsIEEE Transactions on Computers, 1974
- Asynchronous Sequential Machines Designed for Fault DetectionIEEE Transactions on Computers, 1974
- Design of Two-Level Fault-Tolerant NetworksIEEE Transactions on Computers, 1974
- Synthesis of Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-FlopsIEEE Transactions on Computers, 1973
- Fault-Tolerant Computers Using ``Dotted Logic'' Redundancy TechniquesIEEE Transactions on Computers, 1972
- Generation of a Clock Pulse for Asynchronous Sequential Machines to Eliminate Critical RacesIEEE Transactions on Computers, 1971