State-Space Support for Path-Based Reward Variables

Many sophisticated formalisms exist for specifying complex system behaviors, but methods for specifying performance and dependability variables have remained quite primitive. To cope with this problem, modelers often must augment system models with extra state information and event types to support particular variables. This often leads to models that are non-intuitive, and must be changed to support different variables. To address this problem, we extend the array of performance measures that may be derived from a given system model, by developing new performance measure specification and model construction techniques. Specifically, we introduce a class of path-based reward variables, and show how various performance measures may be specified using these variables. Path-based reward variables extend the previous work with reward structures to allow rewards to be accumulated based on sequences of states and transitions. To maintain the relevant history, we introduce the concept of a path automaton, whose state transitions are based on the system model state and transitions. Furthermore, we present a new procedure for constructing state spaces and the associated transition rate matrices that support path-based reward variables. Our new procedure takes advantage of the path automaton to allow a single system model to be used as the basis of multiple performance measures that would otherwise require separate models or a single more complicated model.

[1]  William H. Sanders,et al.  Construction and solution of performability models based on stochastic activity networks , 1988 .

[2]  William H. Sanders,et al.  Reduced base model construction methods for stochastic activity networks , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[3]  Krishna R. Pattipati,et al.  A Unified Framework for the Performability Evaluation of Fault-Tolerant Computer Systems , 1993, IEEE Trans. Computers.

[4]  Kishor S. Trivedi,et al.  Performability Analysis: Measures, an Algorithm, and a Case Study , 1988, IEEE Trans. Computers.

[5]  Edmundo de Souza e Silva,et al.  Calculating transient distributions of cumulative reward , 1995, SIGMETRICS '95/PERFORMANCE '95.

[6]  Kishor S. Trivedi,et al.  Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets , 1993 .

[7]  William H. Sanders,et al.  Stochastic Activity Networks: Structure, Behavior, and Application , 1985, PNPM.

[8]  Terry Williams,et al.  Probability and Statistics with Reliability, Queueing and Computer Science Applications , 1983 .

[9]  William H. Sanders,et al.  Algorithms for the generation of state-level representations of stochastic activity networks with general reward structures , 1995, Proceedings 6th International Workshop on Petri Nets and Performance Models.

[10]  William H. Sanders,et al.  A Unified Approach for Specifying Measures of Performance, Dependability and Performability , 1991 .

[11]  William H. Sanders,et al.  A new methodology for calculating distributions of reward accumulated during a finite interval , 1996, Proceedings of Annual Symposium on Fault Tolerant Computing.

[12]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[13]  Luis G. Vargas Review: Marcel F. Neuts, Matrix-geometric solutions in stochastic models, an algorithmic approach , 1983 .

[14]  Bruno Sericola,et al.  Performability Analysis: A New Algorithm , 1996, IEEE Trans. Computers.

[15]  Antoine-S Bailly,et al.  Science régionale - Walter Isard, Introduction to régional science. Englewood Cliffs (NJ), Prentice-Hall, 1975 , 1975 .

[16]  L. Donatiello,et al.  On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems , 1991, IEEE Trans. Computers.

[17]  William H. Sanders,et al.  Reduced Base Model Construction Methods for Stochastic Activity Networks , 1991, IEEE J. Sel. Areas Commun..

[18]  J. F. Meyer,et al.  Probabilistic modeling , 1995 .

[19]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[20]  William H. Sanders,et al.  Algorithms for the Generation of State-Level Representations of Stochastic Activity Networks with General Reward Structures , 1996, IEEE Trans. Software Eng..