Sciweavers

4 search results - page 1 / 1
» Generating a checking sequence with a minimum number of rese...
Sort
View
ASE
2010
126views more  ASE 2010»
13 years 5 months ago
Generating a checking sequence with a minimum number of reset transitions
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...
Robert M. Hierons, Hasan Ural
ISCIS
2005
Springer
13 years 10 months ago
Generalizing Redundancy Elimination in Checking Sequences
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
K. Tuncay Tekle, Hasan Ural, M. Cihan Yalcin, H&uu...
ASE
2006
123views more  ASE 2006»
13 years 4 months ago
Separating sequence overlap for automated test sequence generation
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...
Robert M. Hierons
BMCBI
2007
106views more  BMCBI 2007»
13 years 4 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...