Computational algorithms for product form solution stochastic Petri nets
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
It is shown that the steady-state probability distribution of stochastic Petri nets (SPNs) with product form solution can be efficiently computed using an algorithm whose space and time complexities are polynomial in the number of places and in the number of tokens in the initial marking of the SPN. Basic to the derivation of such an algorithm is a product form solution criterion proposed by J. L. Coleman et al. (1992). The algorithm relies on the derivation of a recursive expression of the normalization constant that is a generalization of that derived by J. P. Buzen (1973) for multiple class product form queuing networks with load independent service centers.Keywords
This publication has 10 references indexed in Scilit:
- Aggregation methods in exact performance analysis of stochastic Petri netsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Computational algorithms for product form solution stochastic Petri netsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Markovian Petri Net protocols with product form solutionPerformance Evaluation, 1991
- A net level performance analysis of stochastic Petri netsThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1989
- The Distribution of Queuing Network States at Input and Output InstantsJournal of the ACM, 1981
- Mean-Value Analysis of Closed Multichain Queuing NetworksJournal of the ACM, 1980
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975
- Computational algorithms for closed queueing networks with exponential serversCommunications of the ACM, 1973
- Closed Queuing Systems with Exponential ServersOperations Research, 1967
- Jobshop-Like Queueing SystemsManagement Science, 1963