In: IEEE Computer Soc. Press, Proc. of 6th International Workshop on Petri Nets and Performance Models - PNPM'95, Durham, N. Carolina, USA, pages 94-102. 1995.
Abstract: The computation of transitions firing dates 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 date 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.
Back to the Petri Nets Bibliography