DocumentCode
2637918
Title
The cost of eliminating vanishing markings from generalized stochastic Petri nets
Author
Blakemore, Alex
Author_Institution
Maryland Univ., College Park, MD, USA
fYear
1989
fDate
11-13 Dec 1989
Firstpage
85
Lastpage
92
Abstract
A generalized stochastic Petri net can be analyzed by studying the reachability graph of feasible markings. An examination is made of 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 that executes much more rapidly on typical models is examined. Some alternatives to elimination are discussed
Keywords
Petri nets; computational complexity; stochastic processes; asymptotic complexity; feasible markings; generalized stochastic Petri nets; graph-based algorithm; matrix-based algorithm; reachability graph; vanishing markings; Costs; Educational institutions; Petri nets; Power system modeling; Productivity; State-space methods; Steady-state; Stochastic processes; Stochastic systems; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1989. PNPM89., Proceedings of the Third International Workshop on
Conference_Location
Kyoto
Type
conf
DOI
10.1109/PNPM.1989.68542
Filename
68542
Link To Document