Hybrid analysis of SGSPNs with time-dependent transition rates

Performance Evaluation

Volumn 44, Issue 1-4, 2001, Pages 187-209

  Buchholz, Peter ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; RANDOM PROCESSES; STATE SPACE METHODS; SYNCHRONIZATION;

DISCRETE EVENT SIMULATION; PERFORMABILITY ANALYSIS; SUPERPOSED GENERALIZED STOCHASTIC PETRI NETS;

PETRI NETS;

EID: 0035311892     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(00)00057-2     Document Type: Article

References (30)

1. Ajmone-Marsan M., Balbo G., Conte G. A class of generalized stochastic Petri nets for performance evaluation of multiprocessor systems. ACM Trans. Comput. Syst. 2(2):1984;93-122.
2. M. Ajmone-Marsan, G. Chiola, On Petri nets with deterministic and exponential firing times, in: G. Rozenberg (Ed.), Advances in Petri Nets, Lecture Notes in Computer Science, Vol. 266, Springer, Berlin, 1987, pp. 132-145.
3. F. Bause, P. Buchholz, P. Kemper, A toolbox for functional and quantitative analysis of DEDS, in: R. Pujanger, N.N. Savino, B. Serra (Eds.), Quantitative Evaluation of Computing and Communication Systems, Lecture Notes in Computer Science, Vol. 1469, Springer, Berlin, 1998, pp. 356-359.
4. P. Buchholz, A notion of equivalence for stochastic Petri nets, in: G. De Michelis, M. Diaz (Eds.), Application and Theory of Petri Nets, Lecture Notes in Computer Science, Vol. 935, Springer, Berlin, 1995, pp. 161-180.
5. P. Buchholz, Iterative decomposition and aggregation of labelled GSPNs, in: J. Desel, M. Silva (Eds.), Application and Theory of Petri Nets, Lecture Notes in Computer Science, Vol. 1420, Springer, Berlin, 1998, pp. 226-245.
6. Buchholz P. A new approach combining simulation and randomization for the analysis of large continuous time Markov chains. ACM Trans. Modeling Comput. Simulation. 8(2):1998;194-222.
7. Buchholz P. Hierarchical structuring of superposed GSPNs. IEEE Trans. Software Eng. 25(2):1999;166-181.
8. P. Buchholz, G. Ciardo, S. Donatelli, P. Kemper, Complexity of Kronecker operations and sparse matrices with applications to the solution of Markov models. INFORMS J. Comput. 12 (3) (2000) 203-222.
9. Ciardo G., German R., Lindemann C. A characterization of the stochastic process underlying a stochastic Petri net. IEEE Trans. Software Eng. 20:1994;506-515.
10. G. Ciardo, A.S. Miner, A data structure for the efficient Kronecker solution of GSPNs, in: P. Buchholz, M. Silva (Eds.), Proceedings of the Eighth International Workshop on Petri Nets and Performance Models, IEEE CS Press, 1999, pp. 22-31.
11. P.J. Courtois, Decomposability Queueing and Computer System Applications, Academic Press, New York, 1977.
12. S. Donatelli, Superposed generalized stochastic Petri nets: definition and efficient solution, in: R. Valette (Ed.), Application and Theory of Petri Nets, Lecture Notes in Computer Science, Vol. 815, Springer, Berlin, 1994, pp. 258-277.
13. J. Bechta Dugan, K.S. Trivedi, R.M. Geist, V.F. Nicola, Extended stochastic Petri nets: applications and analysis, in: E. Gelenbe (Ed.), Performance, Vol. 84, North-Holland, Amsterdam, 1984.
14. J. Dunkel, H. Stahl, On the transient analysis of stiff Markoff chains, in: L. Simoncini (Ed.), Dependable Computing for Critical Applications, Springer, Berlin, 1993.
15. Gross D., Miller D. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Oper. Res. 32(2):1984;926-944.
16. R.A. Howard, Dynamic Probabilistic Systems: Semi-Markov and Decision Processes, Vol II, Wiley, New York, 1971.
17. Jensen A. Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskr. 36:1953;87-91.
18. Kemper P. Numerical analysis of superposed GSPNs. IEEE Trans. Software Eng. 22(9):1996;615-628.
19. Kemper P. Transient analysis of superposed GSPNs. IEEE Trans. Software Eng. 25(2):1999;182-193.
20. A.M. Law, W.D. Kelton, Simulation Modeling and Analysis, Wiley, New York, 1991.
21. Lewis P.A., Shedler G.S. Simulation of nonhomogeneous Poisson processes by thinning. Naval Res. Logistics Quart. 26(3):1979;403-413.
22. D. Litzba, M. Sczittnick, F.J. Stewing, Yet another simulation output analysis algorithm: the autoregressive, online-update evaluation technique of the modelling tool, HIT, in: Proceedings of the Third European Simulation Congress, 1989.
23. Nicol D., Heidelberger P. A comparative study of parallel algorithms for simulating continuous time Markov chains. ACM Trans. Modeling Comput. Simulation. 5(4):1995;326-354.
24. Plateau B. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. Perform. Eval. Rev. 13:1985;142-154.
25. Sanders W.H., Meyer J.F. Reduced base model construction for stochastic activity networks. IEEE J. Selected Areas Commun. 9(1):1991;25-36.
26. W.H. Sanders, J.F. Meyer, A unified approach for specifying measures of performance, dependability and performability, in: A. Avizienis, J. Laprie (Eds.), Dependable Computing for Critical Applications: Dependable Computing and Fault-Tolerant Systems, Vol. 4, Springer, Berlin, 1991.
27. Shantikumar J.G. Uniformization and hybrid simulation/analytic models of renewal processes. Oper. Res. 34(4):1986;573-580.
28. R.B. Sidje, W.J. Stewart, A survey of methods for computing large sparse matrix exponentials arising in Markov chains, submitted for publication.
29. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
30. K.S. Trivedi, G. Ciardo, M. Mahorta, R.A. Sahner, Dependability and performability analysis, in: L. Donatelli, R. Nelson (Eds.), Performance Evaluation of Computer and Communication Systems Joint Tutorial Papers of Performance'93 and Sigmetrics'93, Lecture Notes in Computer Science, Vol. 729, Springer, Berlin, 1993, pp. 587-612.