A probabilistic analysis of loop programs

https://doi.org/10.1016/0096-0551(89)90019-2Get rights and content

Abstract

We show that the running time of loop programs of constant parameter can be characterized by probabilistic properties of stochastic networks. This result uses the fact that, statistically, the networks involved are equivalent to closed networks for which Mason's rule provides an effective tool for computing statistical measures of complexity.

References (16)

There are more references available in the full text version of this article.

Cited by (2)

View full text