Table 1 Representing 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) = kn | w(v) ≠ kn | B: B(v) is True iff w(v) = kn |
~B: B(v) is True iff w(v) ≠ kn | ||
w(v) = k | w(v) ≠ k | B: B(v) is True iff w(v) = k |
~B: B(v) is True iff w(v) ≠ k | ||
w(v) + z(v) = k | w(v) + z(v) ≠ k | B: B(v) is True iff w(v) + z(v) = k |
~B: B(v) is True iff w(v) + z(v) ≠ k | ||
w(v) = z(v) | w(v) ≠ z(v) | B: B(v) is True iff w(v) = z(v) |
~B: B(v) is True iff w(v) ≠ z(v) |