This paper uses a number of examples to show how probability problems can be solved with the aid of flow graphs. This method has been used with great success by R. A. Howard in his recent work on dynamic probabilistic systems. The approach in this article is somewhat different from Howard's, as the use of flow graphs here is combined with the collective marks method. The problems solved have to do with renewal processes in discrete and continuous time.