Sept. 19, 2002
Workshop on
Boolean Problems
Comparing Changes in Behaviors
compliance
decomposition
can’t change
merging
compliance
node
minimization
non-compliance
elimination
NSC-behavior
Table 1. Comparing two computationally viable theories
less
node flexibility