How Do I Generate All Possible Test Cases From A Given Transition Table Which Represents A Graph Of A Model

See more:

C#

.NET

regular-expression

, +

I have many systems in my project like ATM, Library management etc each one is represented in EFSM ie similar to a graph where vertices are connected with edges. I have a transition table representing the graph. Now the maximum possible paths from start state to destination have to be generated i.e test case generation . I am doing in C#. Another problem is there are self loops in the graph representation...i.e. an edge going to the same node from its staring point. we have put consraints how many time the self loops be considered...........