State-space support for path-based reward variables

Performance Evaluation

Volumn 35, Issue 3, 1999, Pages 233-251

  Obal II, W Douglas ^a   Sanders, William H ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; PETRI NETS; STATE SPACE METHODS;

PATH-BASED REWARD VARIABLES; STOCHASTIC ACTIVITY NETWORKS; STOCHASTIC PETRI NETS;

LARGE SCALE SYSTEMS;

EID: 0032649914     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00010-3     Document Type: Article

References (18)

1. G. Ciardo, A. Blakemore, P.F.J. Chimento, J.K. Muppala, K.S. Trivedi, Automated generation and analysis of Markov reward models using stochastic reward nets, in: IMA Volumes in Mathematics and its Applications, vol. 48, Springer, New York, 1992.
2. E. Çinlar, Introduction to Stochastic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1975.
3. E. de Souza e Silva, R. Gail, Calculating transient distributions of cumulative reward, in: Proceedings of Sigmetrics/ Performance-95, Ottawa, Canada, May 1995, pp. 231-240.
4. L. Donatiello, V. Grassi, On evaluating the cumulative performance distribution of fault-tolerant computer systems, IEEE Trans. Comput. 40(11) (1991) 1301-1307.
5. R.A. Howard, Dynamic Probabilistic Systems, Vol. II: Semi-Markov and Decision Processes, Wiley, New York, 1971.
6. J.F. Meyer, Probabilistic modeling, in: The Twenty-Fifth International Symposium on Fault-Tolerant Computing (FTCS-25), Pasadena, CA, 27-30 June 1995, pp. 88-95.
7. J.F. Meyer, A. Movaghar, W.H. Sanders, Stochastic activity networks: Structure, behavior, and application, in: Proceedings of the International Workshop on Timed Petri Nets, Torino, Italy, 1985, pp. 106-115.
8. H. Nabli, B. Sericola, Performability analysis: A new algorithm, IEEE Trans. Comput. 45(4) (1996) 491-494.
9. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, Johns Hopkins University Press, Baltimore, MD, 1981.
10. W.D. Obal II, W.H. Sanders, Detecting and exploiting symmetry in discrete-state Markov models, Technical Report, 1997.
11. K.R. Pattipati, Y. Li, H.A.P. Blom, A unified framework for the performability evaluation of fault-tolerant computer systems, IEEE Trans. Comput. 42(3) (1993) 312-326.
12. M.A. Qureshi, W.H. Sanders, A new methodology for calculating distributions of reward accumulated during a finite interval, in: Proceedings of the 26th International Symposium on Fault-Tolerant Computing (FTCS-26), Sendai, Japan, 25-27 June 1996, pp. 116-125.
13. M.A. Qureshi, W.H. Sanders, A.P.A. van Moorsel, R. German, Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures, IEEE Trans. Software Engrg. 22(9) (1996) 603-614.
14. W.H. Sanders, J.F. Meyer, A unified approach for specifying measures of performance, dependability, and performability, in: A. Avizienis, J.C. Laprie (Eds.), Dependable Computing for Critical Applications, vol. 4 of Dependable Computing and Fault-Tolerant Systems, Springer, Vienna, 1991, pp. 215-238.
15. W.H. Sanders, Construction and solution of performability models based on stochastic activity networks, Ph.D. Thesis, University of Michigan, 1988.
16. W.H. Sanders, J.F. Meyer, Reduced base model construction methods for stochastic activity networks, IEEE J. Selected Areas Commun., special issue on Computer-Aided Modeling Analysis, and Design of Communication Networks, 9(1) (1991) 25-36.
17. R.M. Smith, K.S. Trivedi, A.V. Ramesh, Performability analysis: Measures, an algorithm, and a case study, IEEE Trans. Comput. 37(2) (1987) 406-417.
18. K.S. Trivedi, Probability and Statistics with Reliability, Queueing and Computer Science Applications, Prentice-Hall, Englewood Cliffs, NJ, 1982.