Friday, 29 November 2013

The Boa FSM

     We began the solemn and long awaited task of our crusade through Boa, considering it as a finite state machine (FSM). The following is our representation of the aforementioned FSM. As you can notice, it seems pretty self-explanatory once spread out and separated from the distractions of function calls and a multitude of code statements. We do hope there are no errors in our interpretation.

The FSM.
Any repeated state should be considered as a single state. It was done for the sake of neatness.
Following the FSM is the function call graph. It depicts the function that is called when a major state change occurs. This is an overly simplistic graph solely for the purpose of providing an association between the FSM and the actual code.

The function call graph

No comments:

Post a Comment