In: PNPM89. Proceedings of the Third International Workshop On Petri Nets and Performance Models, 1989, Kyoto, Japan, pages 84-92. Los Alamitos, CA, USA: IEEE Computer Society Press, 1990.
Abstract: A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. The paper examines the problem of eliminating vanishing states during the solution of a generalized stochastic Petri net. The asymptotic complexity of a matrix based algorithm is shown to grow quadratically with the number of tangible states. A simpler graph based algorithm is examined which executes much faster on typical models. Some alternatives to elimination are discussed.
Keywords: vanishing marking; generalized stochastic net; reachability graph.
Back to the Petri Nets Bibliography