Threshold Logic: Introductory Concepts: Threshold element, capabilities andlimitations of threshold logic, Elementary Properties, Synthesis of Threshold networks:Unate functions, Identification and realization of threshold functions, The map as atool in synthesizing threshold networks. (Sections 7.1, 7.2 of Text)
Reliable Design and Fault Diagnosis: Hazards, static hazards, Design of Hazard-freeSwitching Circuits, Fault detection in combinational circuits, Fault detection incombinational circuits: The faults, The Fault Table, Covering the fault table, Faultlocation experiments: Preset experiments, Adaptive experiments, Boolean differences,Fault detection by path sensitizing. (Sections 8.1, 8.2, 8.3, 8.4, 8.5 of Text)
Sequential Machines: Capabilities, Minimization and TransformationThe Finite state model and definitions, capabilities and limitations of finite statemachines, State equivalence and machine minimization: k-equivalence, Theminimization Procedure, Machine equivalence, Simplification of incompletely specifiedmachines. (Section 10.1, 10.2, 10.3, 10.4 of Text)
Structure of Sequential Machines: Introductory example, State assignment usingpartitions: closed partitions, The lattice of closed partitions, Reduction of outputdependency, Input dependence and autonomous clocks, Covers and generation ofclosed partitions by state splitting: Covers, The implication graph, An application ofstate splitting to parallel decomposition. (Section 12.1, 12.2, 12.3, 12.4, 12.5, 12.6 ofText)
State–Identification and Fault Detection Experiments: Experiments, Homingexperiments, Distinguishing experiments, Machine identification, Fault detectionexperiments, Design of diagnosable machines, Second algorithm for the design of faultdetection experiments. (Sections 13.1, 13.2, 13.3, 13.4, 13.5, 13.6, 13.7 of Text)