DocumentCode
3352026
Title
Performance evaluation of non-Markovian stochastic event graphs
Author
Cubaud, Pierre H.
Author_Institution
CEDRIC, Conservatoire Nat. des Arts et Metiers, Paris, France
fYear
1995
fDate
3-6 Oct 1995
Firstpage
94
Lastpage
102
Abstract
The computation of transitions firing rates of a stochastic event graph is equivalent to the computation of the completion time of some PERT network. We describe a low polynomial complexity algorithm that provides bounds and approximation of any firing rate using properties of integral orderings among random variables. We test the algorithm on some examples and discuss its use for the computation of the network cycle time
Keywords
PERT; Petri nets; computational complexity; stochastic processes; PERT network; low polynomial complexity algorithm; nonMarkovian stochastic event graphs; performance evaluation; transitions firing dates; Approximation algorithms; Art; Computer networks; Delay; Fires; Integral equations; Polynomials; Random variables; Stochastic processes; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1995., Proceedings of the Sixth International Workshop on
Conference_Location
Durham, NC
ISSN
1063-6714
Print_ISBN
0-8186-7210-2
Type
conf
DOI
10.1109/PNPM.1995.524319
Filename
524319
Link To Document