Skip to main content
SpringerLink
Log in

On adaptive experiments for nondeterministic finite state machines

  • ICTSS 2013
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  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)

  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)

    Article  Google Scholar 

  3. Gill, A.: State-identification experiments in finite automata. Inf. Control 4, 132–154 (1961)

  4. Kohavi, Z.: Switching and Finite Automata Theory. McGraw- Hill, New York (1978)

    MATH  Google Scholar 

  5. Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306–320 (1994)

  6. Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc IEEE 84(8), 1090–1123 (1996)

    Article  Google Scholar 

  7. Simao, A., Petrenko, A., Maldonado, J.C.: Comparing finite state machine test. IET Softw. 3(2), 91–105 (2009)

  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)

  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)

  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)

  11. Mathur, A.: Foundations of Software Testing. Addison Wesley, Boston (2008)

  12. Agibalov, G., Oranov, A.: Lectures on Automata Theory. Tomsk State University Publishers, Tomsk (1984). (in Russian)

    Google Scholar 

  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)

  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)

  15. Sandberg, S.: Homing and synchronization sequences, model based testing of reactive systems. LNCS 3472, 5–33 (2005)

    Google Scholar 

  16. Ravikumar, B.: Parallel algorithms for finite automata problems. LNCS 1388, 373 (1998)

    Google Scholar 

  17. Milner, R.: A Calculus of Communicating Systems. Springer, Berlin (1980)

  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)

  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)

  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)

  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)

  22. Kushik, N.: Methods for deriving homing and distinguishing experiments for nondeterministic FSMs. Ph.D. thesis, Tomsk State University, p. 137 (2013)

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

  25. Starke, P.: Abstract Automata. American Elsevier, New York (1972)

    MATH  Google Scholar 

  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)

  27. Petrenko, A., Yevtushenko, N.: Conformance tests as checking experiments for partial nondeterministic FSM. In: Proceedings of FATES’2005, pp. 118–133 (2005)

  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)

  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)

  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. 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)

  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)

  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)

  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)

  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)

  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)

Download references

Author information

Authors and Affiliations

  1. Department of Information Technologies, Tomsk State University, Lenin str. 36, Tomsk, Russia

    Natalia Kushik & Nina Yevtushenko

  2. Department of Network Software, Telecom SudParis, 9 rue Charles Fourier, 91011, Evry Cedex, France

    Natalia Kushik & Ana R. Cavalli

  3. Department of Computer Science and Engineering, American University of Sharjah, University City, PO Box 26666, Sharjah, UAE

    Khaled El-Fakih

Authors
  1. Natalia Kushik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Khaled El-Fakih
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nina Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ana R. Cavalli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Natalia Kushik.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kushik, N., El-Fakih, K., Yevtushenko, N. et al. On adaptive experiments for nondeterministic finite state machines. Int J Softw Tools Technol Transfer 18, 251–264 (2016). https://doi.org/10.1007/s10009-014-0357-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-014-0357-7

Keywords

Search

Navigation