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.
Type de document :
Rapport
[Research Report] RR-1763, INRIA. 1992, pp.18
Liste complète des métadonnées

https://hal.inria.fr/inria-00077003
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:49:12
Dernière modification le : samedi 17 septembre 2016 - 01:06:49
Document(s) archivé(s) le : vendredi 13 mai 2011 - 22:29:33

Fichiers

Identifiants

  • HAL Id : inria-00077003, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

326

Téléchargements de fichiers

73