A new computation method for signature: Markov process method
From MaRDI portal
Recommendations
- Signatures in Markov-modulated processes
- A new distributional approach to signature change
- The uniqueness of signature problem in the non-Markov setting
- scientific article; zbMATH DE number 2089679
- A new generic digital signature algorithm
- A signature algorithm based on chaotic maps and factoring problems
Cited in
(11)- On the signature of complex system: a decomposed approach
- Comparisons of multi-state systems with binary components of different sizes
- On dependent multi-state semi-coherent systems based on multi-state joint signature
- Moments of order statistics from DNID discrete random variables with application in reliability
- On the multi-state signatures of ordered system lifetimes
- Equivalency in joint signatures for binary/multi-state systems of different sizes
- Signatures of multi-state systems based on a series/parallel/recurrent structure of modules
- Computing minimal signature of coherent systems through matrix-geometric distributions
- On ordered system signature and its dynamic version for coherent systems with applications
- Equivalency of multi-state survival signatures of multi-state systems of different sizes and its use in the comparison of systems
- Resilience analysis of k -out-of- n systems
This page was built for publication: A new computation method for signature: Markov process method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120080)
