Definition and Design of Strongly Language Disjoint Checkers

Strongly language-disjoint (SLD) checkers are to sequential systems what strongly code-disjoint checkers are to combinatorial systems. SLD checkers are the largest class of checkers with which a functional system can achieve the totally self-checking goal. Self-checking sequential systems are first addressed, and formal definitions of SLD checkers are given. The design of SLD checkers based on regular combinatorial self-checking components is then considered. >

[1]  John F. Meyer,et al.  On-Line Diagnosis of Unrestricted Faults , 1975, IEEE Transactions on Computers.

[2]  Toshihide Ibaraki,et al.  Fail-Safe Realization of Sequential Machines , 1973, Inf. Control..

[3]  B. Courtois,et al.  Design of SCD Checkers based on Analytical Fault Hypotheses , 1984, ESSCIRC '84: Tenth European Solid-State Circuits Conference.

[4]  Michel Diaz,et al.  Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential Machines , 1979, IEEE Transactions on Computers.

[5]  Bernard Courtois,et al.  Strongly Code Disjoint Checkers , 1988, IEEE Trans. Computers.

[6]  D. A. Anderson,et al.  Design of self-checking digital networks using coding techniques , 1971 .

[7]  Yoshihiro Tohma,et al.  Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code , 1971, IEEE Transactions on Computers.

[8]  James E. Smith,et al.  Strongly Fault Secure Logic Networks , 1978, IEEE Transactions on Computers.

[9]  Henry Y. H. Chuang,et al.  Design of Fail-Safe Sequential Machines Using Separable Codes , 1978, IEEE Transactions on Computers.

[10]  René David,et al.  Minimal Detecting Transition Sequences: Application to Random Testing , 1980, IEEE Transactions on Computers.

[11]  Bernard Courtois,et al.  Strongly language disjoint checkers , 1985 .