Reward model solution methods with impulse and rate rewards: an algorithm and numerical results

Muhammad A. Qureshi, William H. Sanders

Research output: Contribution to journalArticlepeer-review


Reward models have become an important method for specifying performability models for many types of systems. Many methods have been proposed for solving reward models, but no method has proven itself to be applicable over all system classes and sizes. Furthermore, specification of reward models has usually been done at the state level, which can be extremely cumbersome for realistic models. We describe a method to specify reward models as stochastic activity networks (SANs) with impulse and rate rewards, and a method by which to solve these models via uniformization. The method is an extension of one proposed by de Souza e Silva and Gail in which impulse and rate rewards are specified at the SAN level, and solved in a single model. Furthermore, we propose a new technique for discarding paths in the uniformized process whose contribution to the reward variable is minimal, which greatly reduces the time and space required for a solution. A bound is calculated on the error introduced by this discarding, and its effectiveness is illustrated through the study of the performability and availability of a degradable multi-processor system.

Original languageEnglish (US)
Pages (from-to)413-436
Number of pages24
JournalPerformance Evaluation
Issue number4
StatePublished - Jul 1994
Externally publishedYes


  • Markov reward model
  • Performability
  • Stochastic Petri nets
  • Stochastic activity networks
  • Uniformization

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Reward model solution methods with impulse and rate rewards: an algorithm and numerical results'. Together they form a unique fingerprint.

Cite this