Generating the States of a Probabilistic System.

Abstract

An important task in the evaluation of a communication or distribution system is assessing the performance of the system, when its components are subject to random failure. One approach for approximating various such performance measures is to generate a relatively small set of states of the system that covers in probability a large portion of the probabilistic system in order of nonincreasing probability. Rather interestingly, there is an elegant algebraic structure (a lattice) underlying this problem, and this structure can be exploited to produce a relatively effective algorithm for generating in order the states of the given system. In addition, the worst-case computational complexity of the algorithm is shown to be related to a certain algebraic invariant of the lattice.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1986
Accession Number
ADA187896

Entities

People

  • D. R. Shier
  • E. J. Valvo
  • R. E. Jamison

Organizations

  • Clemson University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Classification
  • Computational Complexity
  • Computations
  • Computer Networks
  • Experimental Data
  • Hash Tables
  • Mathematical Analysis
  • Probability
  • Regression Analysis
  • Reliability
  • Scientific Research
  • South Carolina
  • United States
  • Universities

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design