This paper is motivated by the study of the performance of distributed algorithms. The method presented here uses a representation of the algorithm as a network of state-transition graphs. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The state space explosion is handled by a decomposition technique. The generator of the chain is derived using tensor algebra operators.