Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs
From MaRDI portal
Publication:1049628
DOI10.1134/S0005117909050166zbMath1180.93070OpenAlexW2078515175MaRDI QIDQ1049628
Publication date: 13 January 2010
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117909050166
checking of \((s - 1)^{3}\) graph loopsself-diagnosis of the multicomponent computer and communication systemsuniform ordinary bipartite graph
Control/observation systems involving computers (process control, etc.) (93C83) Applications of graph theory to circuits and networks (94C15)
Cites Work
- Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)
- On systems diagnosis of vertex and edge hypercube structures of multiprocessor systems
- System diagnosis of the failed modules and connections in hypercube structures of the multiprocessor computer systems
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- A Theory of Diagnosability of Digital Systems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Unnamed Item
- Unnamed Item
This page was built for publication: Organization of self-diagnosis of the discrete multicomponent systems a structure like bipartite quasicomplete graphs
