DocumentCode :
3322442
Title :
Estimating the mean cycle time for stochastic safe marked graphs
Author :
Magott, J. ; Skudlarski, Kamil
Author_Institution :
Tech. Univ. of Wroclaw, Poland
fYear :
1991
fDate :
2-5 Dec 1991
Firstpage :
86
Lastpage :
94
Abstract :
Stochastic safe marked graphs with exponentially distributed firing time of timed transitions are investigated. An approximate method for estimating the mean cycle time is proposed. The method gives a value that tends to be greater than the exact one. It is of polynomial computational complexity. The estimate is much better than the best PERT network upper bound for networks with exponentially distributed durations of activities. The method is compared with the best upper bound for mean cycle time of stochastic marked graphs. The reasons of error of the above two methods are different. Therefore, one of the methods completes the other, and for given stochastic safe marked graphs one can choose the better one from the two estimates. The approximate method can be used for estimating the mean time of stochastic safe marked graphs with NBUE distributed firing times
Keywords :
computational complexity; stochastic automata; NBUE distributed firing times; PERT network upper bound; approximate method; distributed firing time; mean cycle time; polynomial computational complexity; stochastic safe marked graphs; timed transitions; Computer networks; Distributed computing; Explosions; Petri nets; Polynomials; Random variables; Space exploration; State-space methods; Stochastic processes; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Petri Nets and Performance Models, 1991. PNPM91., Proceedings of the Fourth International Workshop on
Conference_Location :
Melbourne, Vic.
Print_ISBN :
0-8186-2285-7
Type :
conf
DOI :
10.1109/PNPM.1991.238779
Filename :
238779
Link To Document :
بازگشت