12 search results - page 1 / 3 » Generating Checking Sequences for Partial Reduced Finite Sta... |
PTS
2008
13 years 6 months ago
2008
The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is pro...
ASE
2006
13 years 4 months ago
2006
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
ASE
2010
13 years 4 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
ACJ
2004
13 years 4 months ago
2004
ISCIS
2009
Springer
13 years 11 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...