Exact Parametric Analysis of Stochastic Petri Nets

Authors:
Man Li;Nicolas D. Georganas
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 4
Cited 0

Queueing networks—exact computational algorithms: a unified theory based on decomposition and aggregation

Queueing networks—exact computational algorithms: a unified theory based on decomposition and aggregation
Time Scale Decomposition of a Class of Generalized Stochastic Petri Net Models

IEEE Transactions on Software Engineering
Exact Aggregation in Exponential Queueing Networks

Journal of the ACM (JACM)
Numerical solution of nearly decomposable queueing networks

Numerical solution of nearly decomposable queueing networks

Quantified Score

Hi-index	14.98

Visualization

Abstract

An algorithm for exact parametric analysis of stochastic Petri nets is presented. The algorithm is derived from the theory of decomposition and aggregation of Markov chains. The transition rate of interest is confined into a diagonal submatrix of the associated Markov chain by row and column permutations. Every time a new value is assigned to the transition, a smaller Markov chain is analyzed. As a result, the computational cost is greatly reduced.