University of Babylon

College of Education for Pure Sciences

Department of Mathematics

Semester one : advance reliability

Title of Report

Inclusion-exclusion method

By
Doctor student
Murtadha Mohammed

Scientific supervisor
Prof : dr zahir Abdul haddi hassan
2022-2023
 Inclusion-exclusion method
Prof Dr.zahir Abdul Haddi & Murtadha Mohammed

The Inclusion-Exclusion Method

Let m be the number of minimal path sets. A system with m minimal paths
works if and only if at least one of the minimal paths works. System success
corresponds to the event The reliability of the system is equal to the
probability of the union of the m minpaths, namely
 Inclusion-exclusion method
Prof Dr.zahir Abdul Haddi & Murtadha Mohammed

Let

Then, W K represents the sum of the probabilities that any k minimal paths are
simultaneously working. By the Inclusion-Exclusion principle the reliability of
the system, which is equal to the probability of the union of the m minpaths,
can be expressed as:

If there are m pathsets, then this calculation involves 2m−1 terms. In some cases,
two different intersections of Oi ’s will correspond to the same event so that
these different intersections of Oi’s will have the same probability. If one
intersection consists of an odd number ofOi ’s and another intersection consists
of an even number ofOi ’s, they will cancel. And by using the algorithms that
generate only the non cancelling terms:

Ri= pr { Si=1 }∧1−Ri =pr {S i=0 }

Inclusion-exclusion method
 Prof Dr.zahir Abdul Haddi & Murtadha Mohammed

Ex:

Sol : using minpaths

then the system reliability R is:

Inclusion-exclusion method
 Prof Dr.zahir Abdul Haddi & Murtadha Mohammed

Ex: find reliability R the system by Inclusion-exclusion method

S1 S4

S3

S2 S5

Sol : using minpaths

X 1 ={ S 1 S 4 } , X 2= { S2 S 5 } , X 3= { S 1 S3 S 5 } , X 4 ={S2 S 3 S 4 }

W 1=P ( X 1 )+ P ( X 2 ) + P ( X 3 ) + P( X 4 )

W 2=P ( X 1 X 2) + P ( X 1 X 3 )+ P ( X 1 X 4 ) + P ( X 2 X 3 ) + P ( X 2 X 4 ) + P ( X 3 X 4 )

W 3 =P ( X 1 X 2 X 3 X 4 )
 Inclusion-exclusion method
Prof Dr.zahir Abdul Haddi & Murtadha Mohammed

R S=W 1−W 2+ W 3

R S=P ( S 1 S 2) + P ( S2 S 5 ) + P ( S 1 S 3 S5 ) + P ( S2 S 3 S 4 )−P ( S1 S 2 S 4 S 5 )−P ( S 1 S3 S4 S5 ) −P ( S 1 S2 S 3 S 4 )−P ( S1 S 2 S3 S5 ) −P ( S 2 S3 S

=
( R1 R2 ) + ( R2 R5 ) + ( R1 R3 R 5 )+ ( R2 R 3 R 4 )−( R 1 R2 R 4 R5 )−( R 1 R3 R4 R5 ) −( R1 R 2 R3 R4 ) −( R1 R2 R3 R5 ) −( R2 R 3 R 4 R5 )

References
[11] Satyanarayana A., Wood R. K., A Linear-Time Algorithm for Computing K-Terminal
Reliability in Series-Parallel Networks, Siam J. Comput., Society for Industrial and
Applied Mathematics, 1985.
[12] Sun Y. R., Zhou W. Y., An Inclusion-Exclusion Algorithm for Network Reliability
with Minimal Cutsets, American Journal of Computational Mathematics, 2, 316-320,
China, 2012.
[13] Dohmen K., Inclusion-Exclusion and Network Reliability, AMS Classication:
60C05, 68M15, 90B12, 90B25, Germany, 1998.
[14] ZHAO L. C., F.J. KONG, A new formula and an algorithm for reliability analysis of
networks, Microelectron. Reliab., Elsevier Science Ltd., Great Britain, Vol. 37, No. 3, pp.
511-518, 1997.