Abstract
The paper presents a general decomposition formula for the Kterminal reliability of undirected stochastic networks which is based on the partition lattice of a separating vertex set. Using this formula a new approach to network reduction is proposed allowing the reliability analysis of a broader class of networks than the reduction methods known up to now