Reducing the phase space of a stochastic process in system reliability analysis
From MaRDI portal
This article is concerned with analytical bounds for the stationary availability probability and the mean time to total failure for certain complex multi-unit, multi-server Markov and semi-regenerative systems. The context is the computer assistance of reliability and availability prediction software, implemented at ETH Reliability Laboratory, Zürich. A synopsis of computational experience is given.
Recommendations
Cites work
- scientific article; zbMATH DE number 3814723 (Why is no real title available?)
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- scientific article; zbMATH DE number 3793181 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3591262 (Why is no real title available?)
- scientific article; zbMATH DE number 589444 (Why is no real title available?)
- scientific article; zbMATH DE number 1008397 (Why is no real title available?)
- scientific article; zbMATH DE number 1134705 (Why is no real title available?)
- scientific article; zbMATH DE number 3212585 (Why is no real title available?)
- scientific article; zbMATH DE number 3272053 (Why is no real title available?)
- Light traffic equivalence in single-server queues
- Regenerative stochastic processes
Cited in
(3)
This page was built for publication: Reducing the phase space of a stochastic process in system reliability analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288668)