Refinement of Statemachines
From Event-B
Revision as of 22:52, 17 June 2009 by imported>Colin (New page: == Refinement of Statemachines == This example of an ATM (automated teller machine) shows the techniques used to make a refinement of a state machine. The example uses a machine-level sta...)
Refinement of Statemachines
This example of an ATM (automated teller machine) shows the techniques used to make a refinement of a state machine. The example uses a machine-level state machine (i.e. not in a class). The state machines use the state-sets translation which, since there are no class instances, results in each state being represented by a boolean variable.
