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)
Colored GSPN Models and Automatic Symmetry Detection
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Stochastic Activity Networks: Structure, Behavior, and Application
International Workshop on Timed Petri Nets
Numerical analysis of superposed GSPNs
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ON THE USE OF KRONECKER OPERATORS FOR THE SOLUTION OF GENERALIZED STOCHASTIC PETRI NETS
ADAPTIVE RELAXATION FOR THE STEADY-STATE ANALYSIS OF MARKOV CHAINS
ADAPTIVE RELAXATION FOR THE STEADY-STATE ANALYSIS OF MARKOV CHAINS
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Implicit data structures for logic and stochastic systems analysis
ACM SIGMETRICS Performance Evaluation Review
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Formalisms for Specifying Markovian Population Models
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Data representation and efficient solution: a decision diagram approach
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
| Hi-index | 0.00 |
Use of a high-level modeling representation, such as stochastic Petri nets, frequently results in a very large state space. In this paper, we propose new methods that can tolerate such large state spaces and that do not require any special structure in the model. First, we develop methods that generate rows and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix. This permits the caching of portions of the matrix, hence reducing the solution time. Finally, we develop a new memory- and computationally-efficient technique for Gauss-Seidel-based solvers that avoids the need for generating rows of $A$ in order to solve $Ax=b$. Taken together, these new results show that one can solve very large SPN, GSPN, SRN, and SAN models without any special structure.