Start-up demonstration tests under Markov dependence model with corrective actions

DOI10.1023/A:1003122908057zbMath0890.62075OpenAlexW1969883703MaRDI QIDQ1370536

Narayanaswamy Balakrishnan, Sigeo Aki, Sri Gopal Mohanty

Publication date: 22 June 1998

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1003122908057

zbMATH Keywords

waiting timeMarkov chaindiscrete distributionsstart-up demonstration testsrunjoint probability generating function

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Reliability and life testing (62N05)

Related Items (19)

On the distribution of the total number of run lengths ⋮ Run and frequency quotas in a multi-state markov chain ⋮ Quotas on runs of successes and failures in a multi-state markov chain ⋮ On the identifiability of start-up demonstration mixture models ⋮ Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern ⋮ Generalizations of distributions related to \((k_1,k_2)\)-runs ⋮ An efficient algorithm for exact distribution of discrete scan statistics ⋮ Joint distributions of numbers of runs of specified lengths on directed trees ⋮ Statistical inference for start-up demonstration tests with rejection of units upon observingdfailures ⋮ Some binary start-up demonstration tests and associated inferential methods ⋮ On generalized start-up demonstration tests ⋮ Joint distributions of numbers of runs of specified lengths in a sequence of Markov dependent multistate trials ⋮ Start-up demonstration tests with three-level classification ⋮ On the conditional and unconditional distributions of the number of success runs on a circle with applications ⋮ On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials ⋮ Distributions of Runs and Scans on Higher-Order Markov Trees ⋮ Run and Frequency Quotas Under Markovian Fashion and their Application in Risk Analysis ⋮ Joint distributions of numbers of success runs of specified lengths in linear and circular se\-quences ⋮ An algorithm to compute the probability of a run in binary fourth-order Markovian trials.

This page was built for publication: Start-up demonstration tests under Markov dependence model with corrective actions