CYCLE TIME OF STOCHASTIC EVENT GRAPHS - EVALUATION AND MARKING OPTIMIZATION

In this paper we address the performance evaluation and optimization o f a strongly connected event graph with random firing times. We propos ed an upper bound and a lower bound for the average cycle time of even t graphs knowing the initial marking. We then prove that, under some w eak conditions on the firing time distributions, it is possible to rea ch, on average, a cycle time smaller than any given value C with a fi nite marking, assuming that C is greater than the greatest firing tim e. Finally, we propose a heuristic algorithm to reach such an average cycle time while minimizing a p-invariant criterion.