Transient Analysis of Superposed GSPNs

Authors:
Peter Kemper
Affiliations:
-
Venue:
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Year:
1997

Citing 11
Cited 1

Performance models of multiprocessor systems

Performance models of multiprocessor systems
Transient analysis of acyclic markov chains

Performance Evaluation
Computing Poisson probabilities

Communications of the ACM
Numerical transient analysis of Markov models

Computers and Operations Research
Stochastic Automata Network of Modeling Parallel Systems

IEEE Transactions on Software Engineering
Numerical Analysis of Superposed GSPNs

IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
On the stochastic structure of parallelism and synchronization models for distributed algorithms
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications

IEEE Transactions on Software Engineering
Parallel State Space Exploration for GSPN Models

Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Reachability Analysis Based on Structured Representations

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution

Proceedings of the 15th International Conference on Application and Theory of Petri Nets

Structured Solution of Asynchronously Communicating Stochastic Modules

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers transient analysis using randomization for superposed generalized stochastic Petri nets (GSPNs). Since state space explosion implies that space is the bottleneck for numerical analysis, superposed GSPNs profit from the structured representation known for its associated Markov chain. This moves the bottleneck for analysis from space for generator matrices to space for iteration vectors. Hence a variation of randomization is presented which allows to reduce space requirements for iteration vectors. An additional and welcome side effect is that during an initial phase, this algorithm avoids useless multiplications involving states with zero probability. Furthermore it accommodates to adaptive randomization in a natural way.