Check SST solvability

Check SST solvability When SST is ready, solvability analysis have to be done. We search for repeating in N.S.U.
(numerical state of the system) and check, if for selected number repeating appears to have the
same or different working conditions (output and additional elements switching). In the case
above 0, 1 and 3 N.S.U. repeats:
- 0 repeats in steps 0 and 6, however both steps have the same switching condition which are
x=off, y=off,
- 1 repeats in steps 1, 5, 7 and 11, and have the same switching condition which are x=off, y=off as
well,
- 3 repeats in steps 2 and 8 (contradictory states), but has different switching condition - in step 2
x=on & y=off, in step 8 x=off & y=on, so SST is unsolvable right now and additional element(s)
has(have) to be added.
It is useful to notify contradictory states with index of repeating, as on the figure below:
If there are no contradictory states, SST is solvable. If there are any, additional elements have to
be added in correct places. In the case considered, SST is unsolvable.
... zobacz całą notatkę