Proof of Compositionality of CFT Correctness

07/23/2019
by   Simon Greiner, et al.
0

In the paper Compositionality of Component Fault Trees, we present a discussion of the compositionality of correctness of component fault trees. In this technical report, we present the formal proof of the central theorem of the aforementioned publication.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2018

Formal Proofs of Tarjan's Algorithm in Why3, Coq, and Isabelle

Comparing provers on a formalization of the same problem is always a val...
research
03/17/2018

Attack Trees in Isabelle -- CTL semantics, correctness and completeness

In this paper, we present a proof theory for attack trees. Attack trees ...
research
05/25/2021

The Component Diagnosability of General Networks

The processor failures in a multiprocessor system have a negative impact...
research
04/30/2018

A Formal Transformation Method for Automated Fault Tree Generation from a UML Activity Model

Fault analysis and resolution of faults should be part of any end-to-end...
research
12/07/2014

On the Behavioural Formalization of the Cognitive Middleware AWDRAT

We present our ongoing work and initial results towards the (behavioral)...
research
03/14/2018

One Net Fits All: A unifying semantics of Dynamic Fault Trees using GSPNs

Dynamic Fault Trees (DFTs) are a prominent model in reliability engineer...
research
02/01/2021

Verifying the Hashgraph Consensus Algorithm

The Hashgraph consensus algorithm is an algorithm for asynchronous Byzan...

Please sign up or login with your details

Forgot password? Click here to reset