A decomposition approach for stochastic reward net models
Performance Evaluation
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
IEEE Transactions on Computers
Stochastic Petri Net Modeling for Dependability Evaluation of Complex Computer Systems
International Workshop on Timed Petri Nets
Iterative Decomposition and Aggregation of Stochastic Marked Graph Petri Nets
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Approximate Mean Value Analysis for Stochastic Marked Graphs
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
A framework for rare event simulation of stochastic Petri nets using “RESTART”
WSC '96 Proceedings of the 28th conference on Winter simulation
Distributed and structured analysis approaches to study large and complex systems
Lectures on formal methods and performance analysis
Structured Solution of Asynchronously Communicating Stochastic Modules
IEEE Transactions on Software Engineering
An Efficient Kronecker Representation for PEPA Models
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Kronecker Algebra and (Stochastic) Petri Nets: Is It Worth the Effort?
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Structured Characterization of the Markov Chain of Phase-Type SPN
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Structured Solution of Stochastic DSSP Systems
PNPM '97 Proceedings of the 6th International Workshop on Petri Nets and Performance Models
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
Implicit data structures for logic and stochastic systems analysis
ACM SIGMETRICS Performance Evaluation Review
Statistical Performance Analysis and Estimation for Parallel Multimedia Processing
Journal of Signal Processing Systems
Bounding variance and expectation of longest path lengths in DAGs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
The analysis of stochastic marked graphs is considered. The underlying idea is to decompose the marked graph into subnets, to generate state spaces and transition matrices for these isolated parts and then to represent the generator matrix underlying the complete net by means of much smaller subnet matrices combined via tensor operations. Based on this matrix representation, efficient numerical analysis techniques can be used to compute the stationary solution. Furthermore we propose on approximation technique which is similar to known approximate solution techniques for this kind of nets, but our approach is completely integrated in the structured description of the generator matrix. This allows an estimation of the approximation error and the usage of the approximate results as an initial guess for a subsequent iterative analysis, such that the number of required iterations is often significantly reduced.