HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Superposition properties and performance bounds of stochastic timed event graphs

Abstract : This paper addresses the performance evaluation of stochastic timed event graphs. The transition firing times are random variables with general distributions. We first consider a stochastic timed event graph in which the transition firing times are generated by the superposition (or addition) of two sets of random variables. Properties of this system are established. Especially, we prove that the average cycle time is sub-additive, i.e. it is smaller than the sum of the average cycle times of the two stochastic timed event graphs obtained by assigning to each transition one of the two related random variables. Based on these superposition properties, we derive various upper bounds of the average cycle time of a general stochastic timed event graph. Especially, we obtain upper bounds which converge to the exact average cycle time as the standard deviations decrease. Finally, we derive performance bounds for stochastic timed event graphs with bounded transition firing times.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 4:37:03 PM
Last modification on : Friday, February 4, 2022 - 3:22:52 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 7:49:17 PM


  • HAL Id : inria-00074865, version 1



Xiaolan Xie. Superposition properties and performance bounds of stochastic timed event graphs. [Research Report] RR-1807, INRIA. 1992, pp.26. ⟨inria-00074865⟩



Record views


Files downloads