4 ms·
> Transitions = factorial(state). In best case if they don't confuse states and transitions (wich is common) you'll end up with a spaghetti code where goto are
by czzarr 14y ago
> Transitions = factorial(state). In best case if they don't confuse states and transitions (wich is common) you'll end up with a spaghetti code where goto are replaced with callbacks on events.
Hey could you expand on this? I don't understand what you mean by transitions = factorial(state) and why this leads to spaghetti code when you confuse state and transitions.
- ObnoxiousJul 14y agoIn a state/transition model states are the node of an oriented graph . When you reach a state you have a well defined condition (ex connexion established). If you have an oriented graph with N nodes, and the possibility to boucle up on yourself, than you may compute the number of available paths, (edges, transitions, ...) according to this it is [ N possibilties X N possibilieties ]. So I may have a little over stated the number of transitions. :/ (what an idiot) * 7 states <=> 49 possible transitions, * 8 states <=> 64 possible transitions. Possibilities are increasing in a more than polynomial way, with a brain that can remember at most 7 items in memory. A good example of a state transition diagram is in section 7.2.2 http://www.ietf.org/rfc/rfc3720.txt http://www.ietf.org/rfc/rfc3720.txt Soz, for miscalculating.