Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)

Melbourne, Victoria, Australia

Dec. 2, 1991 to Dec. 5, 1991

ISBN: 0-8186-2285-7

pp: 86-94

J. Magott , Tech. Univ. of Wroclaw, Poland

K. Skudlarski , Tech. Univ. of Wroclaw, Poland

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.<>

INDEX TERMS

computational complexity, stochastic automata

CITATION

J. Magott and K. Skudlarski, "Estimating the mean cycle time for stochastic safe marked graphs,"

*Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM)*, Melbourne, Victoria, Australia, , pp. 86-94.

doi:10.1109/PNPM.1991.238779

CITATIONS