Calculating Probability of Subsea Compressor System Failure

AI Thread Summary
The discussion focuses on calculating the probability of failure for a subsea compressor system using Boolean Algebra, specifically the expression F = A U B U (C U D). Given the probabilities for events A, B, C, and D, the calculated probability P[F] is 0.013367. A user initially struggled with the calculation and received guidance on using the associative law and alternative methods. After further discussion, it was suggested that the original problem statement might have been incorrect. Ultimately, the user resolved the issue with the provided assistance.
abba02
Messages
9
Reaction score
0
[SOLVED] Bolean Algebra

Question
The failure of a subsea compressor system is described by the following Boolean
Algebra statement:
F = A UBU(CUD)
If P[A] = 0.01; P = 0.0034; P[C] = 0.00067; P[D] = 0.002, calculate the probability
P[F] given independence between A,B,C,D.
ANSWER[0.013367]

ATTEMPTS AT PROBLEM
I have tried to use the associative expression to solve this but my answer is different from the given answer of .013367
 
Physics news on Phys.org
Welcome to PF!

Hi abba02! Welcome to PF! :smile:

(btw, this probably ought to be in the coursework and homework section)

Show us your attempt, and then we'll know how to help you. :smile:

[And are you sure it's not F = A UBU(C∩D)?]
 
My attempts to solve the problem

It is F = AUBU(CUD)
I had derived the below using the associative law. But after plugging in the values of A,B,C and D , my answer were still different from the given answer.
P(A) +P(B) +P(CUD)-P[A]P-P[A]P[CUD]-PP[CUD]+P[A]PP[CUD]
 
Last edited:
… looks good to me …

Hi abba02! :smile:

Yes, your method looks good to me! :smile:

(though it would be quicker to say P(notF) = P(notA)P(notB)P(notCUD))

ok, now try it with f = A UBU(C∩D), and see what you get.
 
Thanks, With your advise, I have got the solution to the problem. I think that the problem must have been stated wrongly.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top