A group-invariant approach to the synthesis of fault-tolerant systems
A \(k\)-fault-tolerant system is understood as a system possessing the property to function regularly during a given time without loss of its functions and without lowering its efficiency when faults arise in the working of its components. It is utilized a connected graph model of the system so that the vertexes of the graph correspond to resources of the system and the edges -- to the channels between resources. It is assumed that only the vertices of the graph are subject to faults and the edges do not change, but the failed vertices are able to transmit the information. Assume that the system is given by a graph \(G_0\). One has to find such minimal redundant \(k\)-fault-tolerant graph \(G_r\) and \(G_0\subset G_r\), \(k\geq 1\), that in the case when any their \(k\) vertices fail, there will exist an isomorphic embedding of \(G_0\) into \(G_r\) The graph \(G_r\) has minimal redundancy with respect to the original graph \(G_0\) if: (i) \(G_0\subset G_r\), (ii) \(G_r\) has \(k\) span vertices for \(k\)-fault-tolerance, and (iii) no edge of the graph \(G_r\) can be removed without violating the condition of forming \(G_0\) when any \(k\) vertexes of \(G_r\) fail. There were find the necessary and sufficient conditions under which an \(m\)-vertex structure \(G_r\) became \(k\)-fault-tolerant with minimal redundancy equal to 1. It is given the method by which one can obtain all such \(G_r\).
- 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
- Fault tolerant supergraphs with automorphisms
- Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
- 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
- Function of structural fault tolerance and d-limited connected component of CS graph
- Construction of all nonisomorphic minimal vertex extensions of the graph by the method of canonical representatives
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)
