This paper presents an efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a distributed computing system (DCS). We assume that the graph model C(V, E ) for DCS is given. Also, it is assumed that we have path and/or cut information for the network C(V, E ) . Boolean algebraic concepts are used… (More)