Generating feasible transition paths for testing from an extended finite state machine (EFSM) with the counter problem

Conference object English OPEN
Kalaji, AS; Hierons, RM; Swift, S;
  • Publisher: IEEE
  • Related identifiers: doi: 10.1109/ICSTW.2010.25
  • Subject: Search-based testing | Model-based testing | Feasible transition paths | The counter problem | Automatic FTPs generation from EFSMs

The extended finite state machine (EFSM) is a powerful approach for modeling state-based systems. However, testing from EFSMs is complicated by the existence of infeasible paths. One important problem is the existence of a transition with a guard that references a count... View more
Share - Bookmark