Skip to main content
Log in

On the route-oriented method of system diagnostics in digital systems structured as a symmetric bipartite graph

  • Safety, Viability, Reliability, Technical Diagnostics
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose a method for organizing the route-oriented method for diagnostics of digital systems (DS) with the structure of a symmetric bipartite graph. To describe the results of testing individual units, we use the Preparata-Metze-Chien model (PMC). We suppose that the system has a diagnostic monitor that initiates the diagnostic processes. To estimate the value of diagnosability in the analyzed DS, we use the method of potential syndromes. We show that the analyzed DS are no more than 1-diagnosable without repair. For a system including seven processors and seven memory units, we consider an example with an unreliable diagnostics of three faulty components.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Karavai, M.F., Parkhomenko, P.P., and Podlazov, V.S., Combinatorial Methods for Constructing Bipartite Uniform Minimal Quasicomplete Graphs (Symmetrical Block Designs), Autom. Remote Control, 2009, vol. 70, no. 2, pp. 312–327.

    Article  MathSciNet  MATH  Google Scholar 

  2. Vedeshenkov, V.A., Organizing the Diagnostics of Digital Systems with the Structure of a Symmetric Bipartite Graph, Probl. Upravlen., 2009, no. 6, pp. 59–67.

    Google Scholar 

  3. Vedeshenkov, V.A., An Approach to Multiagent Organization of System Diagnosis of Digital Systems Structured as Symmetrical Bipartite Graph, Autom. Remote Control, 2009, vol. 70, no. 11, pp. 1913–1922.

    Article  MATH  Google Scholar 

  4. Barsi, F., Grandoni, F., and Maestrini, P., A Theory of Diagnosability of Digital Systems, IEEE Trans. Comput., 1976, vol. C-25, no. 6, pp. 585–593.

    Article  MathSciNet  Google Scholar 

  5. Vedeshenkov, V.A., A Route-Oriented Self-Diagnosis Method for Digital Systems, Autom. Remote Control, 2005, vol. 66, no. 3. pp. 479–491.

    Article  MathSciNet  MATH  Google Scholar 

  6. Parkhomenko, P.P., Checking Multiprocessor Computer Systems for Serviceability by Analyzing Their Syndrome Graphs, Autom. Remote Control, 1999, vol. 60, no. 5, part 2, pp. 707–713.

    MathSciNet  Google Scholar 

  7. Preparata, F.P., Metze, G., and Chien, R.T., On the Connection Assignment Problem of Diagnosable Systems, IEEE Trans. Electr. Comput., 1967, vol. 16, no. 6, pp. 848–854.

    Article  MATH  Google Scholar 

  8. Vedeshenkov, V.A. and Nesterov, A.M., On Two Methods for Decoding Diagnostic Results in Digital Systems, Elektron. Modelir., 1981, vol. 3, no. 2, pp. 53–58.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. A. Vedeshenkov.

Additional information

Original Russian Text © V.A. Vedeshenkov, 2014, published in Avtomatika i Telemekhanika, 2014, No. 9, pp. 133–143.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Vedeshenkov, V.A. On the route-oriented method of system diagnostics in digital systems structured as a symmetric bipartite graph. Autom Remote Control 75, 1646–1654 (2014). https://doi.org/10.1134/S0005117914090100

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914090100

Keywords

Navigation