Definition and Design of Strongly Language Disjoint Checkers
Abstract
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.
References
[1]
{1} D. A. Anderson, "Design of self-checking digital networks using coding techniques," Univ. Illinois, Res. Rep. 527, Urbana, IL, Sept. 1971.
[2]
{2} J. E. Smith and G. Metze, "Strongly fault secure logic networks," IEEE Trans. Comput., vol. C-27, pp. 491-499, June 1978.
[3]
{3} M. Nicolaidis, I. Jansch, and B. Courtois, "Strongly code disjoint checkers," in Dig. 1984 Int. Symp. Fault-Tolerant Comput., June 1984.
[4]
{4} J. Viaud and R. David, "Sequentially self-checking circuits," in Dig. 1980 Int. Symp. Fault-Tolerant Comput., Oct. 1980.
[5]
{5} I. Jansch and B. Courtois, "Strongly language disjoint checkers," in Dig. 1985 Int. Symp. Fault-Tolerant Comput., June 1985.
[6]
{6} I. Jansch and B. Courtois, "Strongly language disjoint checkers," TIM3/IMAG, Res. Rep. RR468, Grenoble, France, Oct. 1984.
[7]
{7} R. David and P. Thevenod-Fosse, "Detection transition sequences: Application to random testing of sequential circuits," in Dig. 1979 Int. Symp. Fault-Tolerant Comput., June 1979.
[8]
{8} M. Diaz, "Design of totally self-checking and fail-safe machines," in Dig. 1974 Int. Symp. Fault-Tolerant Comput., June 1974.
[9]
{9} F. Özguner, "Design of totally self-checking asynchronous and synchronous sequential machines," in Dig. 1977 Int. Symp. Fault-Tolerant Comput., June 1977.
[10]
{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]
{11} Y. Tohma, Y. Ohyama, and R. Sakai, "Realization of failsafe sequential machines by using a k-out-of-n code," IEEE Trans. Comput., vol. C-20, pp. 1270-1275, Nov. 1971.
[12]
{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]
{13} T. Takaoka and T. Ibaraki, "Fail-safe realization of sequential machines," Inform. Contr., vol. 22, pp. 31-55, Feb. 1973.
[14]
{14} J. Meyer and R. Sundstrom, "On-line diagnosis of unrestricted faults," IEEE Trans. Comput., vol. C-24, pp. 468-475, May 1975.
[15]
{15} I. Jansch and B. Courtois, "Design of SCD checkers based on analytical fault hypotheses," in Proc. Euro. Solid-State Circuits Conf. '84, Sept. 1984.
[16]
{16} M. Nicolaidis and B. Courtois, "Layout rules for the design of self-checking circuits," in Proc. VLSI 85 Conf., Aug. 1985.
[17]
{17} I. Jansch and B. Courtois, "SCD checkers, cellular checkers and multichecker structures," TIM3/IMAG, Res. Rep. RR476, Grenoble, France, Nov. 1984.
Index Terms
- Definition and Design of Strongly Language Disjoint Checkers
Recommendations
Strongly Code Disjoint Checkers
Strongly code-disjoint (SCD) checkers are defined and shown to include totally self-checking (TSC) code-disjoint checkers. This type of checker is the natural companion of strongly fault-secure (SFS) networks. SCD checkers are the largest class of ...
Fault secure property versus strongly code disjoint checkers
The final checker of a self-checking system is an embedded double-rail checker (the partial checkers have in general two outputs). The self-testing or the strongly code disjoint property of this embedded checker can be lost if it is not exercised by an ...
Fault Detection in CVS Parity Trees with Application to Strongly Self-Checking Parity and Two-Rail Checkers
The problem of single stuck-at, stuck-open, and stuck-on fault detection in cascode voltage switch (CVS) parity trees is considered. The results are also applied to parity and two-rail checkers. It is shown that, if the parity tree consists of only ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1988 IEEE. All Rights Reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 01 June 1988
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024