Dependability analysis for large systems: A hierarchical modeling approach

Teresa A. Dahlberg, Dharma P. Agrawal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Dependability analysis of a large network is NP-hard due to the state space explosion. A hierarchical Boolean algebraic method was recently introduced to efficiently evaluate static terminal reliability and task-based reliability by dividing the problem into smaller, more manageable pieces. We extend this method to evaluate time-dependent reliability and availability, collectively referred to as `dependability', and to approximate MTTF.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
Editors Anon
PublisherIEEE Computer Society
Pages456-459
Number of pages4
ISBN (Print)081864222X
StatePublished - Dec 1 1993
EventProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Dec 1 1993Dec 4 1993

Publication series

NameProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing

Other

OtherProceedings of the 5th IEEE Symposium on Parallel and Distributed Processing
CityDallas, TX, USA
Period12/1/9312/4/93

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Dependability analysis for large systems: A hierarchical modeling approach'. Together they form a unique fingerprint.

Cite this