Diagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graph

DOI10.1134/S0005117916030103zbMath1348.93188OpenAlexW2332222159MaRDI QIDQ334223

E. A. Kurako, V. A. Vedeshenkov, Vasilij N. Lebedev

Publication date: 1 November 2016

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117916030103

Mathematics Subject Classification ID

Applications of graph theory (05C90) Observability (93B07) Digital control/observation systems (93C62)

Related Items (3)

Fragment method of restoring the operation of digital systems with the structure of a minimal quasicomplete graph with two paths between two users ⋮ Diagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graph ⋮ Diagnosis of single faulty components of digital systems structured as minimal quasicomplete \(7\times7\) graph with two paths between two users

Cites Work

• Diagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graph
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: Diagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graph