Formal Aspects of Computing

, Volume 30, Issue 2, pp 319–332 | Cite as

Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation

  • Khaled El-Fakih
  • Nina Yevtushenko
  • Natalia Kushik
Original Article
  • 11 Downloads

Abstract

A top-down approach is presented for checking the existence and derivation of an adaptive distinguishing test case (called also an adaptive distinguishing sequence) for a nondeterministic finite state machine (NDFSM). When such a test case exists, the method returns a canonical test case that includes all other distinguishing tests of the given complete observable NDFSM. In the second part of the paper, a constructive approach is provided for deriving a class of complete observable NDFSMs with n states, n >  2, and 2 n n − 1 inputs such that a shortest adaptive distinguishing test case for each NDFSM in the intended class has the length (height) 2 n n − 1. In other words, we prove the reachability of the exponential upper bound on the length of a shortest adaptive distinguishing sequence for complete observable NDFSMs while for deterministic machines the upper bound is polynomial with respect to the number of states. For constructing the intended class of NDFSMs for a given n, we propose a special linear order over all the non-empty subsets without singletons of an n-element set. The obtained tight exponential upper bound initiates further research on identifying certain NDFSM classes where this upper bound is not reachable.

Keywords

Adaptive distinguishing experiments Nondeterministic finite state machines Finite state machine based testing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ACY95.
    Alur R, Courcoubetis C, Yannakakis M (1995) Distinguishing tests for nondeterministic and probabilistic machines, In: Proceedings of the 27th ACM symposium on theory of computing, pp 363–372Google Scholar
  2. BP94.
    Bochmann GV, Petrenko A (1994) Protocol testing: review of methods and relevance for software testing, In: Proceedings of international symposium on software testing and analysis, Seattle, pp 109–123Google Scholar
  3. Gil61.
    Gill A (1961) State-identification experiments in finite automata. Inf Control 4: 132–154MathSciNetCrossRefMATHGoogle Scholar
  4. DFM+10.
    Dorofeeva R, El-Fakih K, Maag S, Cavalli AR, Yevtushenko N (2010) FSM-based conformance testing methods: a survey annotated with experimental evaluation. Inf Softw Technol 52: 1286–1297CrossRefGoogle Scholar
  5. GIT+14.
    Günicen C, İnan K, Türker UC, Yenigün H (2014) The relation between preset distinguishing sequences and synchronizing sequences. Form Asp Comput 26(6): 1153–1167MathSciNetCrossRefMATHGoogle Scholar
  6. GJY15.
    Güniçen C, Jourdan G-V, Yenigün H (2015) Using multiple adaptive distinguishing sequences for checking sequence gen eration. In: Proceedings of the 27th international conference on testing software and systems ICTSS 2015, Lecture notes in computer science 9447, Springer, pp 19–34Google Scholar
  7. HT14.
    Hierons RM, Türker UC (2014) Distinguishing sequences for partially specified FSMs. In: Proceedings of NASA formal methods of the 6th international symposium (NFM 2014), Houston, TX, USA, April 29-May 1, 2014, pp 62–76Google Scholar
  8. Koh78.
    Kohavi Z (1978) Switching and finite automata theory. McGraw- Hill, New YorkMATHGoogle Scholar
  9. KFY11.
    Kushik N, El-Fakih K, Yevtushenko N (2011) Preset and adaptive homing experiments for nondeterministic finite state machines. In: Proceedings of the 16th international conference on implementation and application of automata (CIAA 2011), Blois, France, LNCS 6807, pp 215–224Google Scholar
  10. KFY+16.
    Kushik N, El-Fakih K, Yevtushenko N, Cavalli AR (2016) On adaptive experiments for nondeterministic finite statemachines. Softw Tools Technol Transf 18(3): 251–264CrossRefGoogle Scholar
  11. LY94.
    Lee D, Yannakakis M (1994) finite-statemachines: state identification and verification. IEEETransComput 43(3): 306–320Google Scholar
  12. LY96.
    Lee D, Yannakakis M (1996) Principles and methods of testing finite state machines—a survey. Proc IEEE 84(8): 1090–1123CrossRefGoogle Scholar
  13. Mat08.
    Mathur A (2008) Foundations of software testing. Addison Wesley, BostonGoogle Scholar
  14. PY11.
    Petrenko A, Yevtushenko N (2011) Adaptive testing of deterministic implementations specified by nondeterministic FSMs. Lecture notes in computer science, vol 7019, pp 162–178Google Scholar
  15. SFY07.
    Spitsyna N, El-Fakih K, Yevtushenko N (2007) Studying the separability relation between finite state machines. Softw Test Verif Reliab 17(4): 227–241CrossRefGoogle Scholar
  16. TY14.
    Türker UC, Yenigün H (2014) Hardness and inapproximability of minimizing adaptive distinguishing sequences. FormMeth ods Syst Des 44(3): 264–294MATHGoogle Scholar
  17. TÜY16.
    Türker UC, Ünlüyurt T, Yenigün H (2016) Effective algorithms for constructing minimum cost adaptive distinguishing se quences. Inf Softw Technol 74: 69–85CrossRefGoogle Scholar
  18. FHA+16.
    El-Fakih K, Haddad A, Aleb N, Yevtushenko N (2016) for deriving distinguishing experiments of nondeterministic finite state machines. Appl Soft Comput 49: 1175–1184CrossRefGoogle Scholar

Copyright information

© British Computer Society 2018

Authors and Affiliations

  1. 1.American University of SharjahSharjahUnited Arab Emirates
  2. 2.Tomsk State UniversityTomskRussia
  3. 3.Institute for System Programming RASMoscowRussia
  4. 4.SAMOVAR, CNRS, Télécom SudParisUniversité Paris-SaclayÉvryFrance

Personalised recommendations