Terry Woods said:Can you say "K-MAP"?
Terry Woods said:A big mistake that many programmers make is to think that the K-Map is for "static" conditions only. Wrong. A K-Map can be designed to describe and control "dynamic" conditions as well.
testsubject said...
I was going to try but the excitation table is HUGE. (210=1024 cells!) and when some of the outputs are going to be treated as inputs (like Q-->Q+) the table is even larger.
Another mistake that many programmers make is either not thinking modular at all, or, if they do, defining the module much larger than it really is.
A big mistake that many programmers make is to think that the K-Map is for "static" conditions only. Wrong. A K-Map can be designed to describe and control "dynamic" conditions as well.
dandrade said:Peter Nachtwey
It derived from the evolution of network Petry??? Which was discovered first.
Friedrich Haase said:
In SFC the actions are connected to steps (== states) by action associations. If an action is set/activated by an action association in one step, the action continues to be executed even when the step is no longer active, as long as there is another action association which will reset/deactivate the step.