1993
DOI: 10.1016/b978-0-444-81660-3.50015-0
|View full text |Cite
|
Sign up to set email alerts
|

Consecutive-k-out-of-n Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0
1

Year Published

1994
1994
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 129 publications
0
8
0
1
Order By: Relevance
“…Recently it has been successfully employed in a lot of diverse areas such as reliability (see Chao et at. (1995) or Papastavridis and Koutras (1994)), DNA sequencing (Arratia and Waterman (1985), Goldstein (1990)), psycholoD~, ecology, radar astronomy (Schwager (1983)) etc.…”
Section: Introductionmentioning
confidence: 99%
“…Recently it has been successfully employed in a lot of diverse areas such as reliability (see Chao et at. (1995) or Papastavridis and Koutras (1994)), DNA sequencing (Arratia and Waterman (1985), Goldstein (1990)), psycholoD~, ecology, radar astronomy (Schwager (1983)) etc.…”
Section: Introductionmentioning
confidence: 99%
“…Distributions of this type are of substantial interest in radar and safety systems, time-sharing computer networks etc. In reliability theory terminology, the respective tail probabilities are survival probabilities of consecutive-2-within-k-out-of-n reliability structures (see Chao et al (1995), Papastavridis and Koutras (1993)). Also, the conditional tail distribution given the number of successes, is closely related to the generalised birthday problem, Naus (1968), Saperstein (1972).…”
Section: Htt Hth Htt Hh Hth Tt Hh Hhmentioning
confidence: 99%
“…For the r-within-consecutive-t-out-of-n system (see [9,15,18,191) Papasctavridis and Sfakianakis [16] proved i + 1 > i for 1 5 i 5 min(k -1, n -k ) and i > i + 1 for max(k, n -k + 1) 5 i 5 n -1 and pointed out that these relations cannot be established through Theorem 2.2. Nevertheless they could be easily verified, by making use of our Theorem 2.4.…”
Section: Applicationsmentioning
confidence: 99%