Optimal design by resolving Boolean equations
Bernd Steinbach, Ch. Posthoff · 2004
The optimal design of a non-deterministic finite state machine by solving and resolving Boolean equations is shown, taking advantage of the relationships between single Boolean functions, sets of Boolean functions, Boolean equations, and their solutions. The Boolean differential calculus is used to point out the key ideas of the applied resolvability theory.