Patent ID: 7363202

Claim:
A computerized method comprising: receiving a state space and plural state groupings; and selecting states from a frontier set and performing the following until the frontier set is empty: when a state selected from the frontier set provides a transition to a next state, and the next state provides a variable-value assignment corresponding to at least one of the plural state groupings that is not yet in a set V, adding the next state to the frontier set and to the set V, and adding the transition to a set T; and when a state selected from the frontier set fails to provided an unexplored transition, removing the state from the frontier set; returning the set T as an output finite state machine comprising a set of tuples, wherein the first element of each tuple identifies a start state of a transition, the second element of each tuple identifies a transition, and the third element of each tuple identifies a transition end state; and creating test sequences from the set T.