For the most recent entries see the Petri Nets Newsletter.

Cycle time of stochastic event graphs - evaluation and marking optimization.

Proth, J-M; Xie, X.L.

In: IEEE Trans. on Automatic Control, Vol. 39, No. 7, pages 1482-1486. 1994.

Abstract: In this paper we address the performance evaluation and optimization of a strongly connected event graph with random firing times. We proposed an upper bound and a lower bound for the average cycle time of event graphs knowing the initial marking. We 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, we propose a heuristic algorithm to reach such an average cycle time while minimizing a p-invariant criterion.

Keywords: Petri nets, event graphs, performance bounds.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography