Skip to main content
Log in

Application of the majority connectedness carrier for computing the reliability of complex systems

  • Reliability
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

A computational method for probability of majority connectedness of the two-pole network of a random graph is stated when the union of circuits is used as a connectedness carrier of node-poles. Formal rules for calculations of this type illustrated by the corresponding examples are given.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bogatyrev, V.A., Network Reliability Computing over the Aggregate of Pathes, Elektrosvyaz’, 1981, no. 5, pp. 42–44.

  2. Polesskii, B.P., Clutter Untyings, Correlation Inequalities, and Bounds for Combinatorial Reliability, Probl. Peredachi Inform., 1997, vol. 33, no. 3, pp. 50–70.

    MathSciNet  Google Scholar 

  3. Mizin, I.A., Bogatyrev, V.A., and Kuleshov, A.P., Seti Kommutatsii paketov (Packet Switching Networks), Moscow: Radio i Svyaz’, 1986.

    Google Scholar 

  4. Nadezhnost’ tekhnicheskikh sistem. Spravochnik (Reliability of Technical Systems. Handbook), Ushakov, I.A., Ed., Moscow: Radio i Svyaz’, 1985.

    Google Scholar 

  5. Handbook of Reliability Engineering, Ushakov, I.A. and Harrison, R., Eds., New York: Wiley, 1994.

    MATH  Google Scholar 

  6. Dudnik, B.Ya. and Filin, B.P., Application of the Bipartite Graph Method to Estimate Complex Systems Reliability, Avtom. Telemekh., 1981, no. 12, pp. 154–167.

  7. Netes, V.A. and Filin, B.P., Consideration of Node Failures in Network-Reliability Calculation, IEEE Trans. Reliability, 1996, vol. 49, no. 1, pp. 67–68.

    Google Scholar 

  8. Novik, D.A., Effektivnoe kodirovanie (Effective Coding), Leningrad: Energiya, 1965.

    Google Scholar 

  9. Davydenko, B.P., Loskutov, N.G., and Ivanov, L.I., Osnovy voennoi kibernetiki (Fundamentals of Military Cybernetics), Leningrad: VAS, 1971.

    Google Scholar 

  10. Busacker, R. and Saaty, T., Finite Graphs and Networks: An Introduction with Applications, New York: McGraw-Hill, 1965. Translated under the the Konechnye grafy i seti, Moscow: Nauka, 1974.

    MATH  Google Scholar 

  11. Filin, B.P., Duality Theorem in Problems of Complex Systems Structure-Reliability Analysis, Avtom. Telemekh., 1989, no. 6, pp. 158–172.

  12. Garey, M.R. and Johnson, D.S., Computers and Intractability. A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

  13. Filin, B.P., Metody analiza strukturnoi nadezhnosti setei svyazi (Analysis Techniques for Network-Structure Reliability), Moscow: Radio i Svyaz’, 1998.

    Google Scholar 

  14. Fedorov, A., Borland Pascal: prakticheskoe ispol’zovanie Turbo Vision 2.0. (Borland Pascal: Practical Application of Turbo Vision 2.0.), Kiev: Dialektika, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Original Russian Text © V.N. Kononenko, R.M. Lozitskii, M.V. Nosov, A.S. Romanov, B.P. Filin, 2007, published in Avtomatika i Telemekhanika, 2007, No. 4, pp. 177–189.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kononenko, V.N., Lozitskii, R.M., Nosov, M.V. et al. Application of the majority connectedness carrier for computing the reliability of complex systems. Autom Remote Control 68, 733–744 (2007). https://doi.org/10.1134/S0005117907040157

Download citation

  • Received:

  • Issue Date:

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

PACS number

Navigation