Kishor S. Trivedi

Learn More
Description: Critically acclaimed text for computer performance analysis-now in its second edition The Second Edition of this now-classic text provides a current and thorough treatment of queueing systems, queueing networks, continuous and discrete-time Markov chains, and simulation. Thoroughly updated with new content, as well as new problems and worked(More)
With the growing emphasis on reuse software development process moves toward component based software design As a result there is a need for modeling ap proaches that are capable of considering the architecture of the software and es timating the reliability by taking into account the interactions between the com ponents the utilization of the components(More)
Stochastic Petri nets of various types (SPN, GSPN, ESPN, DSPN etc.) are recognized as useful modeling tools for analyzing the performance and reliability of systems. The analysis of such Petri nets proceeds by utilizing the underlying continuous-time stochastic processes continuous-time Markov chains for SPN and GSPN, semi-Markov processes for a subset of(More)
Several recent studies have reported & examined the phenomenon that long-running software systems show an increasing failure rate and/or a progressive degradation of their performance. Causes of this phenomenon, which has been referred to as "software aging", are the accumulation of internal error conditions, and the depletion of operating system(More)
In this paper, a new algorithm based on Binary Decision Diagram (BDD) for reliability evaluation of Phased Mission System (PMS) is proposed. This algorithm uses phase algebra to deal with the dependence among the phases, and a new BDD operation is proposed to incorporate the phase algebra. Due to the nature of BDD, cancelation of common components among the(More)
This paper examines task allocation in fault-tolerant distributed systems. The problem is formulated as a constrained sum of squares minimization problem. The computational complexity of this problem prompts us to consider an efficient approximation algorithm. We show that the ratio of the performance of the approximation algorithm to that of the optimal(More)
The development of techniques for quantitative, model-based evaluation of computer system dependability has a long and rich history. A wide array of model-based evaluation techniques is now available, ranging from combinatorial methods, which are useful for quick, rough-cut analyses, to state-based methods, such as Markov reward models, and detailed,(More)
We present a decomposition approach for the solution of large stochastic reward nets (SRNs) based on the concept of near-independence. The overall model consists of a set of submodels whose interactions are described by an import graph. Each node of the graph corresponds to a parametric SRN submodel and an arc from submodel A to submodel B corresponds to a(More)
We consider the numerical evaluation of Markov model transient behavior. Our research is motivated primarily by computer system dependability modeling. Other application areas include tinitecapacity queueing models, closed queueing networks, and inventory models. We focus our attention on the general problem of finding the state probability vector of a(More)