Asynchronous State Assignments with Unateness Properties and Fault-Secure Design
- 1 May 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (5) , 396-404
- https://doi.org/10.1109/tc.1978.1675118
Abstract
Techniques to construct standard state assignments that yield unate next-state functions are presented. These proposed assignments use Berger codes. It is established that for any N row flow table, it is possible to constructKeywords
This publication has 11 references indexed in Scilit:
- Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential MachinesIEEE Transactions on Computers, 1979
- Fault-Tolerant Asynchronous Networks Using Read-Only MemoriesIEEE Transactions on Computers, 1978
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- Asynchronous Sequential Machines Designed for Fault DetectionIEEE Transactions on Computers, 1974
- Fault-Tolerant Asynchronous NetworksIEEE Transactions on Computers, 1973
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973
- Realization of Fail-Safe Sequential Machines by Using a k-out-of-n CodeIEEE Transactions on Computers, 1971
- Universal Single Transition Time Asynchronous State AssignmentsIEEE Transactions on Computers, 1969
- Synthesis of Asynchronous Sequential Circuits with Multiple-Input ChangesIEEE Transactions on Computers, 1968
- A note on error detection codes for asymmetric channelsInformation and Control, 1961