Examples
Examples
Try the starting example
- Independent basic events: identifier, probability zero to one
- A,0.1 B,0.2 C,0.3
- Read-once expression: AND(...), OR(...), NOT(...)
- OR(A,AND(B,C))
- Modeled top-event probability
- 0.154
- Complement probability
- 0.846
- Basic events used in expression
- A, B, C
- Supplied events unused by expression
- None
Try another scenario
- Independent basic events: identifier, probability zero to one
- A,0.1 B,0.2 C,0.3
- Read-once expression: AND(...), OR(...), NOT(...)
- AND(A,OR(B,C))
- Modeled top-event probability
- 0.044
- Complement probability
- 0.956
- Basic events used in expression
- A, B, C
- Supplied events unused by expression
- None
Calculation method
Calculation method
Modeled top-event probability
Multiply independent AND probabilities, use one minus product of complements for OR, and complement for NOT. Each basic event may occur only once.
Complement probability
One minus top-event probability.
Basic events used in expression
List each parsed basic event; repeated identifiers are rejected to prevent false independence.
Supplied events unused by expression
Supplied event IDs not referenced by the expression.
Symbols and units
- a
- Independent basic events: identifier, probability zero to one
- b
- Read-once expression: AND(...), OR(...), NOT(...)
Use the units shown. A list keeps the order in which you enter its values. The symbol ^ means “raised to the power of”.
Assumptions & limits
Assumptions & limits
- A read-once Boolean probability model assuming independent supplied basic events over the same period. Shared events and dependent failures are rejected/unsupported; this is not a safety or reliability certification.
Are these inputs private?
These calculations run in your browser. A shared link contains the values you choose to share. Only questions submitted to the separate AI finder are sent to OpenAI.
Further reading
NIST: series/parallel independent-component probability models ↗
Background reading; this does not imply endorsement or independent review of SumFizz.