Fault-Tolerant Asynchronous Networks
- 1 July 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (7) , 662-669
- https://doi.org/10.1109/tc.1973.5009132
Abstract
The design of fault-tolerant asynchronous networks has been an unsolved problem. In this paper, necessary and sufficient conditions on state assignments for fault-tolerant asynchronous networks are given. Three design techniques, based on Liu's 2so - 1 assignment, Friedman et al.'s (2, 2) separating system, and (2so + 1) assignments, are given for fault-tolerant asynchronous networks. The earlier Liu's upper bound on state variables for USTI assignment for 2so rows is improved to 2so - 2so-3.Keywords
This publication has 14 references indexed in Scilit:
- Asynchronous Sequential Machines Designed for Fault DetectionIEEE Transactions on Computers, 1974
- Redundancy by Coding Versus Redundancy by Replication for Failure-Tolerant Sequential CircuitsIEEE Transactions on Computers, 1972
- Coding Techniques for Failure- Tolerant CountersIEEE Transactions on Computers, 1970
- Universal Single Transition Time Asynchronous State AssignmentsIEEE Transactions on Computers, 1969
- Synthesis of Asynchronous Sequential Circuits with Multiple-Input ChangesIEEE Transactions on Computers, 1968
- Internal State Assignments for Asynchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1966
- Synthesis of Error-Tolerant Counters Using Minimum Distance Three State AssignmentsIEEE Transactions on Electronic Computers, 1965
- A State Variable Assignment Method for Asynchronous Sequential Switching CircuitsJournal of the ACM, 1963
- On the Construction of Minimally Redundant Reliable System DesignsBell System Technical Journal, 1961
- A General Method of Applying Error Correction to Synchronous Digital SystemsBell System Technical Journal, 1961