Renewal Networks: Connectivity and Reachability on a Time Interval
Charles J. Colbourn, M. V. Lomonosov · Probability in the Engineering and Informational Sciences · 1991
Efficiently computable bounds are developed for the time to first failure in a communications network with renewable links. The bounds approximate a network with bidirectional or unidirectional links by acyclic networks with unidirectional links.