Reducing the lengths of checking sequences by overlapping

  • Authors:

  • Hasan Ural;Fan Zhang

  • Affiliations:

  • School of Information Technology and Engineering, University of Ottawa;School of Information Technology and Engineering, University of Ottawa

  • Venue:
  • TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

There are two main shortcomings in the existing models for generating checking sequences based on distinguishing sequences. First, these models require a priori selection of state recognition sequences (called α-sequences) which may not be the best selection for yielding substantial reduction in the length of checking sequences. Second, they do not take advantage of overlapping to further reduce the length of checking sequences. This paper proposes an optimization model that tackles these shortcomings to reduce the lengths of checking sequences beyond what is achieved by the existing models by replacing the state recognition sequences with a set of basic sequences called α-elements and by making use of overlapping.