Efficient analysis algorithms for parametric fault trees

Andrea Bobbio; Daniele Codetta-Raiteri; Massimiliano De Pierro; Giuliana Franceschinis

doi:10.1109/FIRB-PERF.2005.9

Efficient analysis algorithms for parametric fault trees

Andrea Bobbio, Daniele Codetta-Raiteri, Massimiliano De Pierro, Giuliana Franceschinis

Dipartimento di Scienze e Innovazione Tecnologica

Risultato della ricerca: Capitolo in libro/report/atti di convegno › Contributo a conferenza › peer review

Abstract

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.

Lingua originale	Inglese
Titolo della pubblicazione ospite	IWIA 2005
Sottotitolo della pubblicazione ospite	Innovative Architecture for Future Generation High-Performance Processors and Systems
Pagine	91-105
Numero di pagine	15
DOI	https://doi.org/10.1109/FIRB-PERF.2005.9
Stato di pubblicazione	Pubblicato - 2005

Serie di pubblicazioni

Nome	Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005
Volume	2005

Accesso al documento

10.1109/FIRB-PERF.2005.9

Altri file e collegamenti

Link to publication in Scopus

Cita questo

Bobbio, A., Codetta-Raiteri, D., De Pierro, M., & Franceschinis, G. (2005). Efficient analysis algorithms for parametric fault trees. In IWIA 2005: Innovative Architecture for Future Generation High-Performance Processors and Systems (pagg. 91-105). Articolo 1587698 (Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005; Vol. 2005). https://doi.org/10.1109/FIRB-PERF.2005.9

Bobbio, Andrea ; Codetta-Raiteri, Daniele ; De Pierro, Massimiliano et al. / Efficient analysis algorithms for parametric fault trees. IWIA 2005: Innovative Architecture for Future Generation High-Performance Processors and Systems. 2005. pagg. 91-105 (Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005).

@inproceedings{37891422694040b7964840e1dcbf4954,

title = "Efficient analysis algorithms for parametric fault trees",

abstract = "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.",

author = "Andrea Bobbio and Daniele Codetta-Raiteri and {De Pierro}, Massimiliano and Giuliana Franceschinis",

year = "2005",

doi = "10.1109/FIRB-PERF.2005.9",

language = "English",

isbn = "0769524478",

series = "Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005",

pages = "91--105",

booktitle = "IWIA 2005",

}

Bobbio, A, Codetta-Raiteri, D, De Pierro, M & Franceschinis, G 2005, Efficient analysis algorithms for parametric fault trees. in IWIA 2005: Innovative Architecture for Future Generation High-Performance Processors and Systems., 1587698, Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005, vol. 2005, pagg. 91-105. https://doi.org/10.1109/FIRB-PERF.2005.9

Efficient analysis algorithms for parametric fault trees. / Bobbio, Andrea; Codetta-Raiteri, Daniele; De Pierro, Massimiliano et al.
IWIA 2005: Innovative Architecture for Future Generation High-Performance Processors and Systems. 2005. pag. 91-105 1587698 (Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005; Vol. 2005).

Risultato della ricerca: Capitolo in libro/report/atti di convegno › Contributo a conferenza › peer review

TY - GEN

T1 - Efficient analysis algorithms for parametric fault trees

AU - Bobbio, Andrea

AU - Codetta-Raiteri, Daniele

AU - De Pierro, Massimiliano

AU - Franceschinis, Giuliana

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33846965272&partnerID=8YFLogxK

U2 - 10.1109/FIRB-PERF.2005.9

DO - 10.1109/FIRB-PERF.2005.9

M3 - Conference contribution

AN - SCOPUS:33846965272

SN - 0769524478

SN - 9780769524474

T3 - Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005

SP - 91

EP - 105

BT - IWIA 2005

ER -

Bobbio A, Codetta-Raiteri D, De Pierro M, Franceschinis G. Efficient analysis algorithms for parametric fault trees. In IWIA 2005: Innovative Architecture for Future Generation High-Performance Processors and Systems. 2005. pag. 91-105. 1587698. (Proceedings - 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems, FIRB-Perf 2005). doi: 10.1109/FIRB-PERF.2005.9

Efficient analysis algorithms for parametric fault trees

Abstract

Serie di pubblicazioni

Accesso al documento

Altri file e collegamenti

Fingerprint

Cita questo