A New Start-Up Demonstration Test

Start-Up Demonstration Tests for Products with Start-Up Delay

“…0, 2,1 , 1,1,0 , 1,1,1 , 1,2,0 , 1,2,1 a r E E ½°°: ® ¾°°¿ * * According to transition rules proposed in Section 3.1, the transition probability matrix has the following form: By using the Markov chain theory, the acceptance/rejection probabilities and some indices related to the test length can be obtained by the following equations (1)(2)(3)(4). The proofs of equations (1-4) are essentially the same as that given in [6] and [7] except for some notations.…”

“…A CSTF test is terminated and the unit is rejected if total d failed start-ups are observed prior to consecutive k successful start-ups, or the test is terminated and the unit is accepted if consecutive k successful start-ups are observed prior to total d failed start-ups. As an extension, TSTF [11], CSCF [11], TSCF [11], CSDF [1], TSCSTF [6], and TSCSTFCF [7], R 1 -CS/TS/R 2 -CF/TF [14] and parallel start-up demonstration test [13] were suggested. Their definitions are almost the same to the CSTF start-up demonstration test except that the word "consecutive" or "total" needs to be replaced appropriately.…”

Start-up demonstration tests with sparse connection

“…Antzoulakos, Koutras, and Rakitzis (2009) introduced the CSDF (consecutive successes distant failures) model and studied a new acceptance/rejection rule which is suitable to use in start-up demonstration tests. As extended models of CSTF, TSCSTF (total successes consecutive successes total failures) and R 1 -CS/TS/R 2 -CF/TF (R 1 runs of consecutive successes, total successes, R 2 runs of consecutive failures, total failures) were proposed by Gera (2010) and Zhao (2014) respectively. Gera (2011) also improved the CSTF test to TSCSTFCF test (total successes consecutive successes total failures consecutive failures) and then he generalized this model to include dependent tests according to the previous-sum dependent model .…”

A Start-Up Demonstration Test Involving Distant Failures

“…However, it is rejected if a certain number of failures is reached before that run ( ). More general models are the TSCSTF and TSCSTFCF procedures which have been presented by Gera [11,12]. According to the TSCSTFCF model, a unit is accepted if either a run of successes or a total number of successes are observed before either a total number of failure or a run of failures ( , , , and ), and vice versa for rejection.…”