2022
DOI: 10.1590/jatm.v14.1284
|View full text |Cite
|
Sign up to set email alerts
|

Path Tracing Method to Evaluate the Signature Reliability Function of a Complex System

Abstract: This paper aims to compute the efficiency of a complex communication system (double-bridge). In this model, which applies the Path Tracing Method for evaluating the reliability function of the complex communication system, the process of analyzing the system's reliability has been used to lower the failure rate of the complex system in order to optimize its competence. The illustrative system is subdivided into nine minimal paths that are arranged in series-parallel combinations. Using the Path Tracing Method,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 30 publications
0
3
0
Order By: Relevance
“…Then if we have independent and identically distributed reliability of components, then we get 𝑅 𝐿𝐵 = 𝑟 2 + 𝑟 4 + 3𝑟 5 + 2𝑟 6 (25)…”
Section: Spross System Boundmentioning
confidence: 99%
See 1 more Smart Citation
“…Then if we have independent and identically distributed reliability of components, then we get 𝑅 𝐿𝐵 = 𝑟 2 + 𝑟 4 + 3𝑟 5 + 2𝑟 6 (25)…”
Section: Spross System Boundmentioning
confidence: 99%
“…Graphs are typically used for system definition in engineering [1][2][3]. A graph G = (V, E) where V is an empty set whose elements are referred to as "vertices" and E is a set of pairwise links between those vertices (nodes), with the probability of vertices/edges being functional [4][5][6]. In this study, we will emphasize that communication between source and sink nodes must continue despite a node or edge failure.…”
Section: Introductionmentioning
confidence: 99%
“…Graphs are typically used for system definition in engineering [1][2][3]. A graph G = (V, E) where V is an empty set whose elements are referred to as "vertices" and E is a set of pairwise links between those vertices (nodes), with the probability of vertices/edges being functional [4][5][6]. In this study, we will emphasize that communication between source and sink nodes must continue despite a node or edge failure.…”
Section: Introductionmentioning
confidence: 99%