8 search results - page 1 / 2 » Generating feasible input sequences for extended finite stat... |
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
ICST
2009
IEEE
13 years 11 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
EH
1999
IEEE
1999
IEEE
Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences
13 years 9 months ago
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the c...
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...
FASE
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...