Long-run availability of a priority system: a numerical approach (Q2565400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2208254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Long-run availability of a priority system: a numerical approach |
scientific article; zbMATH DE number 2208254 |
Statements
Long-run availability of a priority system: a numerical approach (English)
0 references
27 September 2005
0 references
Summary: We consider a basic renewable duplex system characterized by cold standby and subjected to a priority rule. Apart from a general stochastic analysis presented in the previous literature, we introduce a Markov time called the recovery time of the system. In order to obtain the corresponding Laplace-Stieltjes transform, we employ a stochastic process endowed with transition measures satisfying generalized coupled differential equations. The solution is provided by the theory of sectionally holomorphic functions.
0 references
repairmen
0 references
0.88321936
0 references
0 references
0.8356363
0 references
0.83530945
0 references
0.83234066
0 references
0.83004904
0 references
0.82789636
0 references
0.82779664
0 references