Probabilistic analysis of dynamic fault trees using HOL theorem proving
From MaRDI portal
Recommendations
- Towards Formal Fault Tree Analysis Using Theorem Proving
- A framework for formal dynamic dependability analysis using HOL theorem proving
- Formalization of fault trees in higher-order logic: a deep embedding approach
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- Reasoning about conditional probabilities in a higher-order-logic theorem prover
Cited in
(13)- Formalization of fault trees in higher-order logic: a deep embedding approach
- Formalization of RBD-based cause consequence analysis in HOL
- A framework for formal dynamic dependability analysis using HOL theorem proving
- Formalization of normal random variables in HOL
- Formalization of finite-state discrete-time Markov chains in HOL
- Towards Formal Fault Tree Analysis Using Theorem Proving
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- An approach for lifetime reliability analysis using theorem proving
- Formal reasoning about classified Markov chains in HOL
- Reasoning about conditional probabilities in a higher-order-logic theorem prover
- Formal Verification of Rewriting Rules for Dynamic Fault Trees
- Dynamic dependability analysis of shuffle-exchange networks
- A framework for formal probabilistic risk assessment using \textsf{HOL} theorem proving
This page was built for publication: Probabilistic analysis of dynamic fault trees using HOL theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869611)
