2002
DOI: 10.3390/e4050142
|View full text |Cite
|
Sign up to set email alerts
|

Boltzmann-like Entropy in Reliability Theory

Abstract: Abstract:We introduce the entropy function in order to study the reliability and repairability of systems. In detail we establish the explicit relationships between reliability and repairability; then we calculate the decay of a system due to its regular running.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 4 publications
0
9
0
Order By: Relevance
“…In particular we mean to calculate the effects of repairs and maintenance processes under general assumptions. This work follows two articles previously published on the same vein of research [2,3].…”
Section: Introductionmentioning
confidence: 82%
“…In particular we mean to calculate the effects of repairs and maintenance processes under general assumptions. This work follows two articles previously published on the same vein of research [2,3].…”
Section: Introductionmentioning
confidence: 82%
“…Formally, the generic state Ai (i = 1, 2, … m) is equipped with n sub-states: Ai = (Ai1 AND Ai2 AND … AND Ain), n > 0 (5) We consider that the states of the stochastic system S can be more or less reversible [9], and mean to calculate the reversibility property using the Boltzmann-like entropy Hi where Pi is the probability of Ai:…”
Section: A Lesson From Thermodynamicsmentioning
confidence: 99%
“…Then, it is possible to use the algorithm determining the path with the least number of edges instead of the algorithm determining the shortest path. 2 To this end, each edge of length kh, k = 1, . .…”
Section: Remarkmentioning
confidence: 99%
“…Under certain constraints on the distribution tail area of the operation time of individual paths, the distribution tail area of the operation time of the entire graph is defined by the slowest failing path. If the times of failure-free operation of the edges have weibullized distributions [1,2], then under some assumptions the asymptotics of the distribution tail area of the time of graph operation is defined by the quickest failing edge of the slowest failing path. Therefore, the asymptotic methods enable substantial simplification of calculations with the use of the logical-and-probabilistic approach to modeling [3,4].…”
Section: Introductionmentioning
confidence: 99%