Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers 1995
DOI: 10.1109/ftcs.1995.466972
|View full text |Cite
|
Sign up to set email alerts
|

Componentwise decomposition for an efficient reliability computation of systems with repairable components

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2003
2003
2017
2017

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…For systems where each component can be individually and simultaneously repaired at a constant rate, Balakrishnan and Trivedi [172] proposed to convert the model into a Markov Chain, although this method uses an approximation to reduce computational requirements.…”
Section: Repairable Fault Treesmentioning
confidence: 99%
“…For systems where each component can be individually and simultaneously repaired at a constant rate, Balakrishnan and Trivedi [172] proposed to convert the model into a Markov Chain, although this method uses an approximation to reduce computational requirements.…”
Section: Repairable Fault Treesmentioning
confidence: 99%
“…In addition to the extensions of the fault trees described in the above subsections, there are different other extensions such as repairable fault trees (Balakrishnan & Trivedi, 1995;Beccuti, Codetta-Raiteri, Franceschinis, & Haddad, 2008;Codetta-Raiteri, Franceschinis, Iacono, & Vittorini, 2004), temporal fault trees (Gluchowski, 2007;Palshikar, 2002;Wijayarathna & Maekawa, 2000), Stochastic Hybrid Fault Tree Automaton (SHyFTA) (Chiacchio et al, 2016), and non-coherent fault trees (Beeson, 2002;Contini, Cojazzi, & Renda, 2008) etc. Interested readers are referred to (Ruijters & Stoelinga, 2015) for more information about these fault tree extensions.…”
Section: Fuzzy Fault Treesmentioning
confidence: 99%
“…The results of the sub-models are integrated into a single overall model that is small enough to be processed. Among them we have the behavioral decomposition technique [22], the hybrid hierarchical technique [23], the data structure technique for the Kroneker solution of GSPNs [24], the method of superposed GSPNs [25] or of the asynchronous communicating modules [26]. Most of these techniques are efficient when the sub-models are loosely coupled.…”
Section: Related Workmentioning
confidence: 99%