A group-invariant approach to the synthesis of fault-tolerant systems

MaRDI QIDQ1377941zbMATH OpenFDO

Authors M. F. Karavai

Publication date 15 March 1998

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-fault-tolerant system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Network design and communication in computer systems (68M10)

Recommendations

• Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
• Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
• Construction of all minimal edge extensions of the graph with isomorphism rejection
• scientific article; zbMATH DE number 861431

Cited in

(6)

• Operability restoration procedure for fault-tolerant digital systems with dynamic redundancy
• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
• Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
• Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
• Function of structural fault tolerance and \(d\)-limited connected component of CS graph
• Fault tolerant supergraphs with automorphisms

This page was built for publication: A group-invariant approach to the synthesis of fault-tolerant systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377941)