By Topic

Cycle time of stochastic event graphs: evaluation and marking optimization

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Proth, J.-M. ; INRIA, Metz, France ; Xiao-Lan Xie

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

Published in:

Automatic Control, IEEE Transactions on  (Volume:39 ,  Issue: 7 )