• DocumentCode
    779682
  • Title

    Protocol conformance testing using multiple UIO sequences

  • Author

    Shen, Y.-N. ; Lombardi, F. ; Dahbura, A.T.

  • Author_Institution
    Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
  • Volume
    40
  • Issue
    8
  • fYear
    1992
  • fDate
    8/1/1992 12:00:00 AM
  • Firstpage
    1282
  • Lastpage
    1287
  • Abstract
    Automatic generation of conformance test sequences for communication protocols by means of unique input/output (UIO) sequences is addressed. It is shown that if multiple minimum-length UIO sequences are computed for each state of the finite-state-machine (FSM) specification, then the length of the resulting test sequence is significantly reduced without an appreciable increase in the time needed to compute the sequence. An algorithm for assignment of the multiple UIO sequences is given. This algorithm, which is based on network flow, is polynomial in the number of states and transitions of the FSM and is effective in reducing the overall length of the test sequence
  • Keywords
    conformance testing; finite automata; protocols; communication protocols; conformance testing; finite-state-machine; multiple UIO sequences; network flow; unique input/output sequences; Approximation algorithms; Automata; Automatic testing; Communications Society; Computer science; Costs; Graph theory; Polynomials; Protocols; Robustness;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.156631
  • Filename
    156631