Table 2 Representing Boolean valuations by predicates
From: Distinguishing extended finite state machine configurations using predicate abstraction
V r has each valuation v such that | V t has each valuation v such that | Related Predicates |
|---|---|---|
w(v) ⊕ z(v) = 1 | w(v) ⊕ z(v) = 0 | B: B(v) is True iff w(v) ≠ z(v) |
~B: B(v) is True iff w(v) = z(v) | ||
w(v) ∨ z(v) = 1 | ~w(v) ∧ ~ z(v) = 0 | B: B(v) is True iff w(v) ∨ z(v) = 1 |
~B: B(v) is True iff ~ w((v) ∨ z(v)) ≠ 1 |