An improved EFSM model for class test
Hang Lei · Jisuanji gongcheng · 2005
Due to the variable interdependencies among the operations and preconditions, certain paths of an extended finite state machine (EFSM) may not be feasible. These infeasible paths complicate the class test generation process from EFSMs. By transforming UML state diagrams into extended finite state machines (EFSMs), an algorithm is presented to eliminate the infeasible paths in these EFSMs. Thus a class test model for object-oriented software can be constructed.The model is suitable for class testing by using control and data flow analysis techniques.