Darren New wrote:
James G. Sack (jim) wrote:
The resulting program conducts a full state-space search of
your algorithm,
Must be for very ... small protocols.
That doesn't logically follow.
Most state machines have very few transition links and machine
interdependencies, therefore the state space is usually close to O(n)
with the number of states.
All you are verifying is that for any state S, there exists a way to
leave that state. That's not that hard a problem. Tedious, yes, but
not hard.
Computers are good at tedious but not hard.
-a
--
[email protected]
http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-lpsg
