Advertisement

Reducing the Lengths of Checking Sequences by Overlapping

  • Hasan Ural
  • Fan Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3964)

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.

Keywords

Input Sequence Finite State Machine Output Sequence State Recognition Test Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocolconformance test sequence generation based on UIO sequences and rural Chinese postmantours. IEEE Trans. on Comm. 39, 1604–1615 (1991)CrossRefGoogle Scholar
  2. 2.
    Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier North Holland, Inc., New York (1976)CrossRefMATHGoogle Scholar
  3. 3.
    Chen, J., Hierons, R.M., Ural, H., Yenigun, H.: Eliminating redundant tests in a checkingsequence. In: Proc. of IFIP TestCom 2005, May 2005, pp. 146–158 (2005)Google Scholar
  4. 4.
    Chow, T.: Testing software design modeled by finite-state machines. IEEE Trans. Software Eng. SE-4, 178–187 (1978)CrossRefMATHGoogle Scholar
  5. 5.
    Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley and Sons, New York (1998)MATHGoogle Scholar
  6. 6.
    Dahbura, A.T., Sabnani, K.K., Uyar, M.U.: Formal methods for generating protocol conformance test sequences. Proc. of IEEE 78, 1317–1325 (1990)CrossRefGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)MATHGoogle Scholar
  8. 8.
    Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw-Hill, NY (1962)MATHGoogle Scholar
  9. 9.
    Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. on Computer 19, 551–558 (1970)CrossRefMATHGoogle Scholar
  10. 10.
    Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proc. 5th. Symp. Switching Circuit Theory and Logical Design, Princeton, N.J, pp. 95–110 (1964)Google Scholar
  11. 11.
    Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Trans. on Computers 51(9), 1111–1117 (2002)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Hieron, R., Ural, H.: Optimizing the length of checking sequences. submitted to IEEE Trans. on Computers (2004)Google Scholar
  13. 13.
    Inan, K., Ural, H.: Efficient checking sequences for testing finite state machines. Information and Software Technology 41, 799–812 (1999)CrossRefGoogle Scholar
  14. 14.
    Kohavi, Z.: Switching and Finite State Automata Theory. McGraw-Hill, New York (1978)MATHGoogle Scholar
  15. 15.
    Lee, D., Yannakakis, M.: Testing finite state machines: state identification and verification. IEEE Trans. on Computers 43, 306–320 (1994)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Ural, H., Wu, X., Zhang, F.: On minimizing the length of checking sequence. IEEE Trans. on Computers 46, 93–99 (1997)CrossRefGoogle Scholar
  17. 17.
    Vasilevskii, M.P.: Failure diagnosis of automata. Kibernetika 4, 98–108 (1973)MathSciNetGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Hasan Ural
    • 1
  • Fan Zhang
    • 1
  1. 1.School of Information Technology and EngineeringUniversity of OttawaCanada

Personalised recommendations