Cycle time of stochastic event graphs: evaluation and marking optimization

Addresses the performance evaluation and optimization of a strongly connected event graph with random firing times. The authors proposed an upper bound and a lower bound for the average cycle time of event graphs knowing the initial marking. The authors then prove that, under some weak conditions on the firing time distributions, it is possible to reach, on average, a cycle time smaller than any given value C* with a finite marking, assuming that C* is greater than the greatest firing time. Finally, the authors propose an heuristic algorithm to reach such an average cycle time while minimizing a p-invariant criterion