Sut tool

If no real SUT is available you can simulate an SUT from a state machine model using the Sut tool.
We employ the UPPAAL GUI to specify SUTs.

For example :

Figure 2: Example model of the alternating bit protocol receiver

Using the Sut tool we can easily generate a running SUT from the above model. Note that we can only learn a restricted class of extended finite state machines (EFSM), i.e. Scalarset Mealy machines. For details on the restrictions, please study the Making SUT page and our paper "Automata Learning Through Counterexample-Guided Abstraction Refinement" [CEGAR12].