• Home
  • Search
  • Optimizing the length of checking sequences
  • Cite Icon94
  • https://doi.org/10.1109/tc.2006.80Copy DOI Icon

Optimizing the length of checking sequences

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A checking sequence, generated from a finite state machine, is a test sequence that is guaranteed to lead to a failure if the system under test is faulty and has no more states than the specification. The problem of generating a checking sequence for a finite state machine M is simplified if M has a distinguishing sequence: an input sequence D~ with the property that the output sequence produced by M in response to D is different for the different states of M. Previous work has shown that, where a distinguishing sequence is known, an efficient checking sequence can be produced from the elements of a set A of sequences that verify the distinguishing sequence used and the elements of a set /spl gamma/ of subsequences that test the individual transitions by following each transition t by the distinguishing sequence that verifies the final state of t. In this previous work, A is a predefined set and /spl gamma/ is defined in terms of A. The checking sequence is produced by connecting the elements of /spl gamma/ and A to form a single sequence, using a predefined acyclic set E/sub c/ of transitions. An optimization algorithm is used in order to produce the shortest such checking sequence that can be generated on the basis of the given A and E/sub c/. However, this previous work did not state how the sets A and E/sub c/ should be chosen. This paper investigates the problem of finding appropriate A and E/sub c/ to be used in checking sequence generation. We show how a set A may be chosen so that it minimizes the sum of the lengths of the sequences to be combined. Further, we show that the optimization step, in the checking sequence generation algorithm, may be adapted so that it generates the optimal E/sub c/. Experiments are used to evaluate the proposed method.

Similar Papers
  • Conference Article
  • Citations1

Alternative B-Sequences

  • Jan 01, 2007
  • Lihua Duan +1
  • Conference Article
  • Citations17

Checking Sequence Construction Using Adaptive and Preset Distinguishing Sequences

  • Jan 01, 2009
  • Robert M Hierons +3
  • Book Chapter
  • Citations37

Generating Checking Sequences for Partial Reduced Finite State Machines

  • Jan 01, 2008
  • Adenilso Simão +1
  • Research Article
  • Citations86

Reduced length checking sequences

  • Sep 01, 2002
  • IEEE Transactions on Computers
  • R.M Hierons +1
  • Conference Article
  • Citations11

Chesmin: a heuristic for state reduction in incompletely specified finite state machines

  • Jun 25, 2003
  • S Goren +1
  • PDF
  • Book Chapter
  • Citations14

From Passive to Active FSM Inference via Checking Sequence Construction

  • Jan 01, 2017
  • Alexandre Petrenko +3
  • Dissertation

Um estratégia para geração de seqüências de verificação para máquinas de estados finitos

  • Jan 01, 2013
  • Paulo Henrique Ribeiro
  • Conference Article
  • Citations14

Using adaptive distinguishing sequences in checking sequence constructions

  • Mar 16, 2008
  • Robert M Hierons +3
  • Research Article
  • Citations17

Overcoming observability problems in distributed test architectures

  • Mar 09, 2006
  • Information Processing Letters
  • J Chen +2
  • Research Article
  • Citations12

Efficient checking sequences for testing finite state machines

  • Aug 05, 1999
  • Information and Software Technology
  • K Inan +1
  • Research Article

적합성시험을 위한 프로토콜 시험항목 생성방법의 비교분석

  • Aug 30, 2017
  • The Journal of Korea Institute of Information, Electronics, and Communication Technology
  • Chul Kim
  • Conference Article
  • Citations2

Synthesis of easily testable sequential circuits with checking sequences

  • Nov 26, 1992
  • S Shibatani +1
  • Book Chapter

Generating Minimum Height ADSs for Partially Specified Finite State Machines

  • Aug 04, 2015
  • Robert M Hierons +1
  • PDF
  • Research Article
  • Citations2

Efficient parallel derivation of short distinguishing sequences for nondeterministic finite state machines using MapReduce

  • Nov 20, 2021
  • Journal of Big Data
  • Bilal Elghadyry +3
  • Conference Article
  • Citations1

Deriving Distinguishing Sequences for Input/Output Automata

  • Sep 01, 2020
  • Nina Yevtushenko +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.