Stochastic timed event graphs : bounds, cycle time reachability and marking optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Stochastic timed event graphs : bounds, cycle time reachability and marking optimization

Abstract

This paper addresses the performance evaluation and optimization of stochastic timed event graphs. The transitions firing times of such a timed event graph are random variables with general distribution. We first establish an upper bound and a lower bound for the average cycle time of the timed event graph. We prove that any cycle time greater than the greatest mean transition firing time can be reached by putting enough tokens in each place. The necessary and sufficient condition of the reachability of the greatest mean firing time is established. We then address the marking optimization problem which consists in obtaining a given cycle time while minimizing a linear criterion depending on the initial marking.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1763.pdf (1.08 Mo) Télécharger le fichier

Dates and versions

inria-00077003 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077003 , version 1

Cite

Jean-Marie Proth, Nathalie Sauer, Xiaolan Xie. Stochastic timed event graphs : bounds, cycle time reachability and marking optimization. [Research Report] RR-1763, INRIA. 1992, pp.18. ⟨inria-00077003⟩
190 View
108 Download

Share

Gmail Facebook X LinkedIn More