DocumentCode
1625598
Title
An algorithm to compute possibilistic reliability
Author
Cappelle, Bart ; Kerre, Etienne E.
Author_Institution
ABN AMRO Bank N.V., Brussels, Belgium
fYear
1995
Firstpage
350
Lastpage
354
Abstract
The mathematical representation of human behaviour and incomplete information is one of the most important challenges in reliability modelling. Several papers have been devoted to this topic but only few concern algorithms to compute the possibilistic system reliability from the component reliabilities. In this paper, we present an algorithm to approximate the possibilistic and the dual possibilistic reliability function of a system represented by an n-ary structure function. From these approximations we deduce an approximation of the necessistic and dual necessistic reliability function when the necessity measure is dual with respect to an order reversing mapping on the unit interval
Keywords
possibility theory; reliability theory; component reliabilities; dual possibilistic reliability function; human behaviour; incomplete information; n-ary structure function; order reversing mapping; possibilistic reliability; possibilistic system reliability; reliability modelling; Boundary conditions; Computer science; Humans; Lattices; Mathematical model; Mathematics; Reliability engineering; Reliability theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Uncertainty Modeling and Analysis, 1995, and Annual Conference of the North American Fuzzy Information Processing Society. Proceedings of ISUMA - NAFIPS '95., Third International Symposium on
Conference_Location
College Park, MD
Print_ISBN
0-8186-7126-2
Type
conf
DOI
10.1109/ISUMA.1995.527720
Filename
527720
Link To Document