Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
Fault-tolerant behavior is an important non-functional requirement for systems that involve high criticality. We present a framework which allows the analysis of faulttolerant beh...
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...