DocumentCode
2600448
Title
Algorithms for product-form stochastic Petri nets-A new approach
Author
Coleman, J.L.
Author_Institution
Applied Maths, Adelaide Univ., SA, Australia
fYear
1993
fDate
19-22 Oct 1993
Firstpage
108
Lastpage
116
Abstract
A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant
Keywords
Petri nets; computational complexity; recursive functions; PF-SPNs; geometric sums; numerical complexity; product-form stochastic Petri nets; recursive algorithm; Australia; Closed-form solution; Petri nets; Queueing analysis; Solid modeling; State-space methods; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on
Conference_Location
Toulouse
Print_ISBN
0-8186-4250-5
Type
conf
DOI
10.1109/PNPM.1993.393430
Filename
393430
Link To Document