Distributive lattices in the problems of structural analysis for complex systems

• Autorzy: Grishkevich A.A.
• Języki publikacji: EN

Abstrakty

EN

The problem of estimating structural reliability of complex systems is considered, the model of these systems being represented as a graph of a network type. The structural reliability is understood as the reliability component conditioned by the structure of a system, i.e. by the composition of its elements and their interconnection, the quantitative calculation of the operation particularities of functioning of the elements being not taken into account. A breach connection between the two marked vertices (source and sink) is considered as the criterion of the system's failure. In mathematical terms the solution to this problem is formulated as the problem of finding cuts (minimum cuts) of a graph separating the twa marked vertices (source, sink). Lattice-theory properties of the minimum cuts allowing to achieve an effective method for their search and enumeration are considered.

Słowa kluczowe

EN

structural analysis; lattice-theory properties; distributive lattice of minimum cuts of a graph

• Wydawca: Wydawnictwo Politechniki Częstochowskiej
• Czasopismo: Informatyka Teoretyczna i Stosowana
• Rocznik: 2005
• Tom: R. 5, nr 8
• Strony: 19--27
• Opis fizyczny: Bibliogr. 8 poz., rys.

Twórcy

autor

Grishkevich A.A.

• Electrical Faculty, Częstochowa University of Technology

Bibliografia

• [1] Malinowski J., Non-binary decomposition trees - a method of reliability computation for systems with known minimal paths/cuts. - Reliability engineering and system safety 84 (2004) 113-124
• [2] Chanda R.S., Bhattacharjee P.K., A reliability approach to transmission expansion planning using minimal cut theory. - Electric power systems research 53 (1995) 111-117.
• [3] Billinton R., Guangbin L., A new technique for active minimal cut set selection used in substation reliability evaluation. - Microelectron. Reliab., Vol. 35, No 5, pp 797-808, 1995.
• [4] Grishkevich A.A., Distributive lattice of minimum cut sets of a derected graph. -Informatyka Teoretyczna i Stosowana (Instytut Matematyki i Informatyki, Politechnika Czestochowska), 2004 (in appear).
• [5] Grishkevich A.A., Extreme structures of electrical circuits and systems mathematical models combinatorial methods research: Monography. Chelyabinsk: Publishing house SUSU, 2004. – 258p.
• [6] Hu T., Integer programming and Network Flows. Addison-Wesley, Reading, Mass., 1969.
• [7] Ford L.R., Fulkerson D.R., Przepływy w sieciach. Warszawa, 1969.
• [8] Aigner M., Combinatorial theory. Springer-Verlag, 1979.