Reliability analysis of a simple replicated and-fork/and-join graph

In this paper, the authors consider the problem of calculating the reliability of the replicated and-fork/and-join (RAFAJ) task graphs. An RAFAJ task graph is generated from an AFAJ task graph with vertex and arc replications. Due to the AFAJ constraint, the task graphs considered in the present problem are more general than those considered in the network reliability problem, which is an NP-complete problem for general task graphs. In this paper, the authors propose an algorithm with time complexity O(në2^2r); where n is number of concurrent tasks, and r is the number of replications.