We consider stochastic periodic flow lines where identical sets of jobs are repeatedly produced in the same loading and processing sequence. Each machine has an input buffer with enough capacity. Processing times are stochastic. We model the shop as a stochastic event graph, a class of Petri nets. We characterize the ergodicity condition and the cycle time. For the case where processing times are exponentially distributed, we present a way of computing queue length distributions. For two-machine cases, by the matrix geometric method, we compute the exact queue length distributions. For general cases, we present two methods of approximately decomposing the line model into two-machine submodels, one based on starvation propagation and the other based on transition enabling probability propagation.