Publication | Closed Access
Strongly code disjoint checkers
132
Citations
9
References
1988
Year
Program CheckingEngineeringVerificationComputer-aided VerificationModel CheckingSoftware AnalysisFormal VerificationEquivalence CheckingComputer EngineeringNetworked Computer SystemsScd CheckersDistributed SystemsComputer ScienceCode Disjoint CheckersProgram AnalysisAutomated ReasoningFormal MethodsNatural CompanionCode-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 checkers with which a combinational system may achieve the TSC goal. Some examples are given to illustrate the design of SCD checkers.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1