Talk:State Machine Transition Tables Completeness

From IGSTK

Does this page imply there will be manual code reviews to check for fully populated state transition tables? That seems like a waste of effort to me. We at ASU are writing static analysis tools to check for SM structural validity. We can check for things like:

1. Does the SM define a transition on every input? 2. Is every input generate-able from some Request or Event transduction? 3. Is every Event transduced to an input the SM expects? 4. Does the SM follow the AttemptTo pattern properly?

and so on. Not only are these "toolable" so one can integrate them into the dashboard, but they should be integrated into the code itself. As I tried to point out a long time ago, the process of initializing a state machine can be governed by a state machine itself. SetReadyToRun() should not complete successfully if the SM cannot pass a self-check for a fully populated table (or any other constraint the designer might declare).