Formal reliability analysis of redundancy architectures

DOI10.1007/s00165-018-0475-1zbMath1425.68039OpenAlexW2906720428WikidataQ128640284 ScholiaQ128640284MaRDI QIDQ667523

Alessandro Cimatti, Cristian Mattarei, Marco Bozzano

Publication date: 13 March 2019

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-018-0475-1

zbMATH Keywords

reliability analysisfault tree analysis (FTA)predicate abstractionequality and uninterpreted functions (EUF)redundancy architecturessatisfiability modulo theory (SMT)triple modular redundancy (TMR)

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Model-based safety assessment of a triple modular generator with xSAP

Uses Software

• PRISM
• SHARPE
• SPIN
• MRMC
• CUDD
• UCLID
• SPNP
• MathSAT5
• nuXmv
• OCRA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Configuration logics: modeling architecture styles
• M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
• The UltraSAN modeling environment
• Symbolic Fault Tree Analysis for Reactive Systems
• Design and Verification of Fault-Tolerant Components
• Graph-Based Algorithms for Boolean Function Manipulation
• An Algorithm for the Accurate Reliability Evaluation of Triple Modular Redundancy Networks
• Computer Aided Verification
• The MathSAT5 SMT Solver
• To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
• Interpolants and Symbolic Model Checking

This page was built for publication: Formal reliability analysis of redundancy architectures