loading...
Efficient Analysis Algorithms for Parametric Fault Trees
2005 Workshop on Techniques, Methodol ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Andrea Bobbio, Università del Piemonte Orientale
Daniele Codetta-Raiteri, Università di Torino
Massimiliano De Pierro, Università di Torino
Giuliana Franceschinis, Università del Piemonte Orientale
The Fault Tree (FT) is a widespread model for the dependability (reliability) analysis. One of its several extensions is called Parametric Fault Tree (PFT) and is oriented to redundant systems providing a compact (parametric) way to model replicated components or subsystems. This paper presents the PFT solution method based on a new form of Binary Decision Diagrams (BDD), called Parametric BDD (pBDD). Such method exploits the parametric form combined with the advantages of the use of BDDs. pBDDs are used for both the qualitative and the quantitative analysis of PFTs. A case of redundant system supports the introduction and the application of the new method.
Citation:
Andrea Bobbio, Daniele Codetta-Raiteri, Massimiliano De Pierro, Giuliana Franceschinis, "Efficient Analysis Algorithms for Parametric Fault Trees," firb-perf,pp.91-105, 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems (FIRB-PERF'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Click here to go to beta feedback form