Advertisement

On adaptive experiments for nondeterministic finite state machines

  • Natalia KushikEmail author
  • Khaled El-Fakih
  • Nina Yevtushenko
  • Ana R. Cavalli
ICTSS 2013

Abstract

Adaptive experiments are well defined in the context of finite state machine (FSM) based analysis, in particular, in FSM based testing where homing and distinguishing experiments with FSMs are used for test derivation. In this paper, we define and propose algorithms for deriving adaptive homing and distinguishing experiments for non-initialized nondeterministic finite state machines (NFSMs). For NFSMs, the construction of adaptive experiments is rather complex as the partition over produced outputs does not define a partition over the set of states but a collection of intersecting subsets, and thus, the refinement of such set system is more difficult than the refinement of a partition. Given a complete non-initialized possibly non-observable NFSM, we establish necessary and sufficient conditions for having adaptive homing and distinguishing experiments and evaluate the height of these experiments.

Keywords

Nondeterministic finite state machine Conformance testing Adaptive homing and distinguishing experiments 

References

  1. 1.
    Bochmann, G.V., Petrenko, A.: Protocol testing: review of methods and relevance for software testing. In: Proceedings of International Symposium on Software Testing and Analysis, Seattle, pp. 109–123 (1994)Google Scholar
  2. 2.
    Dorofeeva, R., El-Fakih, K., Maag, S., Cavalli, A.R., Yevtushenko, N.: FSM-based conformance testing methods: a survey annotated with experimental evaluation. Inf. Softw. Technol. 52, 1286–1297 (2010). (Elsevier)CrossRefGoogle Scholar
  3. 3.
    Gill, A.: State-identification experiments in finite automata. Inf. Control 4, 132–154 (1961)Google Scholar
  4. 4.
    Kohavi, Z.: Switching and Finite Automata Theory. McGraw- Hill, New York (1978)zbMATHGoogle Scholar
  5. 5.
    Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306–320 (1994)Google Scholar
  6. 6.
    Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc IEEE 84(8), 1090–1123 (1996)CrossRefGoogle Scholar
  7. 7.
    Simao, A., Petrenko, A., Maldonado, J.C.: Comparing finite state machine test. IET Softw. 3(2), 91–105 (2009)Google Scholar
  8. 8.
    Moore, E.F.: Gedanken-experiments on sequential machines. In: Automata Studies: Annals of Mathematics Studies, vol. 34, pp. 129–153. Princeton Univ. Press, Princeton (1956)Google Scholar
  9. 9.
    Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proceedings of 5th Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, pp. 95–110 (1964)Google Scholar
  10. 10.
    Petrenko, A., Simao, A., Yevtushenko, N.: Generating checking sequences for nondeterministic finite state machines. In: Proceedings of IEEE International Conference on Software Testing, Verification, and Validation (ICST-2012), pp. 310–319 (2012)Google Scholar
  11. 11.
    Mathur, A.: Foundations of Software Testing. Addison Wesley, Boston (2008)Google Scholar
  12. 12.
    Agibalov, G., Oranov, A.: Lectures on Automata Theory. Tomsk State University Publishers, Tomsk (1984). (in Russian)Google Scholar
  13. 13.
    Ginsburg, S.: On the length of the smallest uniform experiment which distinguishes the terminal states of a machine. J. ACM 5(3), 266–280 (1958)Google Scholar
  14. 14.
    Hibbard, T.N.: Lest upper bounds on minimal terminal state experiments of two classes of sequential machines. J. ACM 8(4), 601–612 (1961)Google Scholar
  15. 15.
    Sandberg, S.: Homing and synchronization sequences, model based testing of reactive systems. LNCS 3472, 5–33 (2005)Google Scholar
  16. 16.
    Ravikumar, B.: Parallel algorithms for finite automata problems. LNCS 1388, 373 (1998)Google Scholar
  17. 17.
    Milner, R.: A Calculus of Communicating Systems. Springer, Berlin (1980)Google Scholar
  18. 18.
    Alur, R. Courcoubetis, C., Yannakakis, M.: Distinguishing tests for nondeterministic and probabilistic machines. In: Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 363–372 (1995)Google Scholar
  19. 19.
    Spitsyna, N., El-Fakih, K., Yevtushenko, N.: Studying the separability relation between finite state machines. Softw. Test. Verif. Reliab. 17(4), 227–241 (2007)Google Scholar
  20. 20.
    Hierons, R.M., Jourdan, G.-V., Ural, H., Yenigun, H.: Checking sequence construction using adaptive and preset distinguishing sequences. In: Proceedings of the Software Engineering and Formal Methods, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods, pp. 157–166 (2009)Google Scholar
  21. 21.
    Kushik, N., El-Fakih, K., Yevtushenko, N.: 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–224 (2011)Google Scholar
  22. 22.
    Kushik, N.: Methods for deriving homing and distinguishing experiments for nondeterministic FSMs. Ph.D. thesis, Tomsk State University, p. 137 (2013)Google Scholar
  23. 23.
    Hwang, I., Yevtushenko, N., Cavalli, A.: Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs. Inf. Process. Lett. 112(7), 298–301 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Kushik, N., Yevtushenko, N.: On the length of homing sequences for nondeterministic finite state machines. In: Proceedings of the 18th International Conference on Implementation and Application of Automata (CIAA 2013), pp. 220–231 (2013)Google Scholar
  25. 25.
    Starke, P.: Abstract Automata. American Elsevier, New York (1972)zbMATHGoogle Scholar
  26. 26.
    Zhang, F., Cheung, T.: Optimal transfer trees and distinguishing trees for testing observable nondeterministic finite-state machines. IEEE Trans. Softw. Eng. 19(1), 1–14 (2003)Google Scholar
  27. 27.
    Petrenko, A., Yevtushenko, N.: Conformance tests as checking experiments for partial nondeterministic FSM. In: Proceedings of FATES’2005, pp. 118–133 (2005)Google Scholar
  28. 28.
    Gromov, M.L., Evtushenko, N.V., Kolomeets, A.V.: On the synthesis of adaptive tests for nondeterministic finite state machines. Progr. Comput. Softw. 34(6), 322–329 (2008)Google Scholar
  29. 29.
    Petrenko, A., Yevtushenko, N.: Adaptive testing of deterministic implementations specified by nondeterministic FSMs. In: Proceedings of the International Conference on Testing Software and Systems (ICTSS 2011), LNCS 7019, pp. 162–178 (2011)Google Scholar
  30. 30.
    Tretmans, J.: Model-based testing with labelled transition systems: there is nothing more practical than a good theory. Slides from the lecture in TAROT Summer School’2010 (2010). http://tarot2010.ist.tugraz.at/slides/Tretmans.pdf
  31. 31.
    Gromov, M., El-Fakih, K., Shabaldina, N., Yevtushenko, N.: Distinguishing non-deterministic timed finite state machines. In: Proceedings of the FMOODS/FORTE’2009, pp. 137–151 (2009)Google Scholar
  32. 32.
    El-Fakih, K., Gromov, M., Shabaldina, N., Yevtushenko, N.: Distinguishing experiments for timed nondeterministic finite state machines. Acta. Cybern. 21(2), 205–222 (2013)Google Scholar
  33. 33.
    Andres, C., Yevtushenko, N., Cavalli A.R.: Modeling and testing the European train control system. Technical Report TechRca 14–03-2013, Telecom Sudparis (2013)Google Scholar
  34. 34.
    Leeke, M., A.: Evaluating the use of reference run models in fault injection analysis. In: Proceedings of the 15th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC’2009), pp. 121–124 (2009)Google Scholar
  35. 35.
    Petrenko, A., Yevtushenko, N., Bochmann, G.V.: Testing Deterministic Implementations from their Nondeterministic Specifications. In: Proceedings of the IFIP Ninth International Workshop on Testing of Communicating Systems, pp. 125–140 (1996)Google Scholar
  36. 36.
    Kushik, N., El-Fakih, K., Yevtushenko, N.: Adaptive homing and distinguishing experiments for nondeterministic finite state machines. In: Proceedings of the 25th International Conference on Testing Software and Systems (ICTSS 2013), Istanbul, Turkey, LNCS 8254, pp. 33–48 (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Natalia Kushik
    • 1
    • 2
    Email author
  • Khaled El-Fakih
    • 3
  • Nina Yevtushenko
    • 1
  • Ana R. Cavalli
    • 2
  1. 1.Department of Information TechnologiesTomsk State UniversityTomskRussia
  2. 2.Department of Network SoftwareTelecom SudParisEvry CedexFrance
  3. 3.Department of Computer Science and EngineeringAmerican University of SharjahSharjahUAE

Personalised recommendations