On Computing Signatures of k-out-of-n Systems Consisting of Modules

Gaofeng Da (), Lvyu Xia and Taizhong Hu ()
Additional contact information
Gaofeng Da: University of Science and Technology of China
Lvyu Xia: University of Science and Technology of China
Taizhong Hu: University of Science and Technology of China

Methodology and Computing in Applied Probability, 2014, vol. 16, issue 1, 223-233

Abstract: Abstract In this paper, we study how to compute the signature of a k-out-of-n coherent system consisting of n modules. Formulas for computing the signature and the minimal signature of this kind of systems based on those of their modules are derived. Examples are presented to demonstrate the applications of our formulas. The main results obtained in this paper generalize some related ones in recent literature.

Keywords: Signature; Minimal signature; Module; k-out-of-n system; Reliability; 60K10; 90B25 (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s11009-012-9308-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:metcap:v:16:y:2014:i:1:d:10.1007_s11009-012-9308-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-012-9308-5

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().