In: Microelectronics and Reliability, Vol. 29, pages 733-735. 1989.
Abstract: In this paper a method is proposed for the enumeration of all the k-trees in a network, and a new algorithm is introduced which uses the k-trees for evaluating the k-reliability, ie the probability that at least k of the network modes are connected. This reliability measure gives the overall reliability as a special case. The proposed method evaluates this measure using the concepts of Petri nets.
Keywords: decision tree; K-tree; network reliability.