This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Definition and Design of Strongly Language Disjoint Checkers
June 1988 (vol. 37 no. 6)
pp. 745-748
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

[1] D. A. Anderson, "Design of self-checking digital networks using coding techniques," Univ. Illinois, Res. Rep. 527, Urbana, IL, Sept. 1971.
[2] J. E. Smith and G. Metze, "Strongly fault secure logic networks,"IEEE Trans. Comput., vol. C-27, pp. 491-499, June 1978.
[3] M. Nicolaidis, I. Jansch, and B. Courtois, "Strongly code disjoint checkers," inDig. 1984 Int. Symp. Fault-Tolerant Comput., June 1984.
[4] J. Viaud and R. David, "Sequentially self-checking circuits," inDig. 1980 Int. Symp. Fault-Tolerant Comput., Oct. 1980.
[5] I. Jansch and B. Courtois, "Strongly language disjoint checkers," inDig. 1985 Int. Symp. Fault-Tolerant Comput., June 1985.
[6] I. Jansch and B. Courtois, "Strongly language disjoint checkers," TIM3/IMAG, Res. Rep. RR468, Grenoble, France, Oct. 1984.
[7] R. David and P. Thevenod-Fosse, "Detection transition sequences: Application to random testing of sequential circuits," inDig. 1979 Int. Symp. Fault-Tolerant Comput., June 1979.
[8] M. Diaz, "Design of totally self-checking and fail-safe machines," inDig. 1974 Int. Symp. Fault-Tolerant Comput., June 1974.
[9] F.Özguner, "Design of totally self-checking asynchronous and synchronous sequential machines," inDig. 1977 Int. Symp. Fault-Tolerant Comput., June 1977.
[10] M. Diaz, P. Azema, and J. Ayache, "Unified design of self-checking and fail-safe combinational circuits and sequential machines,"IEEE Trans. Comput., vol. C-28, pp. 276-281, Mar. 1979.
[11] Y. Tohma, Y. Ohyama, and R. Sakai, "Realization of failsafe sequential machines by using ak-out-of-ncode,"IEEE Trans. Comput., vol. C-20, pp. 1270-1275, Nov. 1971.
[12] H. Chuang and S. Das, "Design of fail-safe sequential machines using separable codes,"IEEE Trans. Comput., vol. C-27, pp. 249-252, Mar. 1978.
[13] T. Takaoka and T. Ibaraki, "Fail-safe realization of sequential machines,"Inform. Contr., vol. 22, pp. 31-55, Feb. 1973.
[14] J. Meyer and R. Sundstrom, "On-line diagnosis of unrestricted faults,"IEEE Trans. Comput., vol. C-24, pp. 468-475, May 1975.
[15] I. Jansch and B. Courtois, "Design of SCD checkers based on analytical fault hypotheses," inProc. Euro. Solid-State Circuits Conf. '84, Sept. 1984.
[16] M. Nicolaidis and B. Courtois, "Layout rules for the design of self-checking circuits," inProc. VLSI 85 Conf., Aug. 1985.
[17] I. Jansch and B. Courtois, "SCD checkers, cellular checkers and multichecker structures," TIM3/IMAG, Res. Rep. RR476, Grenoble, France, Nov. 1984.

Index Terms:
strongly language disjoint checkers; sequential systems; totally self-checking; fault location; logic testing.
Citation:
I. Jansch, B. Courtois, "Definition and Design of Strongly Language Disjoint Checkers," IEEE Transactions on Computers, vol. 37, no. 6, pp. 745-748, June 1988, doi:10.1109/12.2215
Usage of this product signifies your acceptance of the Terms of Use.