A Methodology for the Formal Verification of Dynamic Fault Trees Using HOL Theorem Proving
Dynamic Fault Trees (DFTs) are increasingly being used for modeling the failure behaviors of systems, particularly dynamic behaviors that cannot be captured using conventional combinatorial models. Traditionally, paper and pencil or simulation are used for the analysis of DFTs. While the former can...
Main Authors: | Yassmeen Elderhalli, Osman Hasan, Sofiene Tahar |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8845573/ |
Similar Items
-
Formal verification of Matrix based MATLAB models using interactive theorem proving
by: Ayesha Gauhar, et al.
Published: (2021-03-01) -
Study of Isabelle/HOL on Formal Algorithm Analysis and Code Generation
by: Haitao Wang, et al.
Published: (2021-01-01) -
Formal analysis of 2D image processing filters using higher-order logic theorem proving
by: Adnan Rashid, et al.
Published: (2022-06-01) -
Symbolic logic and mechanical theorem proving /
by: 336504 Chang, Chin-Ling, et al.
Published: (1973) -
Logic for computer science : foundations of automatic theorem proving /
by: 455116 Gallier, Jean H.
Published: (1986)