Please use this identifier to cite or link to this item:
Title: A mathematical model to evaluate the unavailability of a technical system
Authors: González, L. 
UNESCO Clasification: 1208 Probabilidad
110202 Algebra de Boole
Keywords: Hamming weight
Intrinsic order
Pascal's triangle
Stochastic Boolean function
System unavailability
Top binary n-tuples
Issue Date: 2006
Conference: 5th International Conference on Engineering Computational Technology, ECT 2006 
Abstract: A new algebraic method is presented for obtaining lower and upper bounds on the unavailability of a technical system depending on n statistically independent random Boolean variables. The efficiency is based on the selection of binary n-tuples (system elementary states) with occurrence probabilities as large as possible. For this purpose: (i) We only select binary n-tuples whose occurrence probabilities are always among the 2 n-1 largest ones, the so-called Top binary n-tuples (which can be characterized by several simple positional criteria). (ii)We provide a simple, recursive formula (tightly related to the famous Pascal's triangle) for rapidly computing the sums of the occurrence probabilities of the binary n-tuples with weight m whose 1s are placed among the k right-most positions (1 ≤ m ≤ k ≤ n).
ISBN: 978-1-905088-09-6
DOI: 10.4203/ccp.84.210
Source: Proceedings of the 5th International Conference on Engineering Computational Technology
Appears in Collections:Actas de congresos
Show full item record


checked on Feb 21, 2021

Page view(s)

checked on Feb 21, 2021

Google ScholarTM




Export metadata

Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.