Skip to main content
Log in

Deriving Homing Sequences for Finite State Machines with Timed Guards

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

State identification is a well-known problem in the theory of finite state machines (FSM). In this theory homing sequences (HS) allow to identify the current state of an FSM and are widely used for testing and verification of hardware and software systems. Sufficient and necessary conditions for the existence of preset and adaptive HS are established for various kinds of FSMs, such as partial and complete machines, deterministic and nondeterministic, and algorithms for deriving these sequences are proposed when such a sequence exists. Nowadays, time-related aspects must be considered when verifying and testing hardware and software, which is why FSM models are extended by clock variables. This work studies the problems of checking the existence and synthesis of preset and adaptive homing sequences for FSMs with timed guards and we show that the length estimates for these sequences coincide with the estimates for classical FSMs. A proposed approach is based on the FSM abstraction of a timed FSM, that is, on the description of this timed FSM by a corresponding FSM that preserves the properties of the timed FSM related to homing sequences.

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

Access this article

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.

Similar content being viewed by others

REFERENCES

  1. Gill, A., Introduction to the Theory of Finite-State Machines, McGraw-Hill, 1962.

    MATH  Google Scholar 

  2. Lee, D. and Yannakakis, M., Testing finite state machines: State identification and verification, IEEE Trans. Comput., 1994, vol. 43, no. 3, pp. 306–320.

    Article  MathSciNet  Google Scholar 

  3. Hibbard, T.N., Least upper bounds on minimal terminal state experiments for two classes of sequential machines, J. ACM, 1961, vol. 8, no. 4, pp. 601–612.

    Article  Google Scholar 

  4. Kohavi, Z., Switching and Finite Automata Theory, McGraw-Hill, 1978.

    MATH  Google Scholar 

  5. Starke, P., Abstract Automata, Am. Elsevier, 1972.

  6. Bochmann, G. and Petrenko, A., Protocol testing: Review of methods and relevance for software testing, Proc. of International Symposium on Software Testing and Analysis, 1994, pp. 109–124.

  7. Jourdan, G.-V., Ural, H., and Yenigun, H., Reduced checking sequences using unreliable reset, Inf. Process. Lett., 2015, vol. 115, no. 5, pp. 532–535.

    Article  MathSciNet  Google Scholar 

  8. Kushik, N., López, J., Cavalli, A., and Yevtushenko, N., Improving protocol passive testing through “Gedanken” experiments with finite state machines, IEEE International Conference on Software Thality, Reliability and Security, 2016, pp. 315–322.

  9. Hennie, F., Fault-detecting experiments for sequential circuits, Proceedings of Fifth Annual Symposium on Circuit Theory and Logical Design, 1965, pp. 95–110.

  10. Chow, T.S., Testing software design modeled by finite-state machines, IEEE Trans. Software Eng., 1978, vol. 4, no. 3, pp. 178–187.

    Article  Google Scholar 

  11. Wang, H.-E., Tu, K.-H., Jiang, J.-H.R., and Kushik, N., Homing sequence derivation with quantified Boolean satisfiability, in Testing Software and Systems, Springer, 2017, pp. 230–242.

    Google Scholar 

  12. Yenigun, H., Yevtushenko, N., Kushik, N., and López, J., The effect of partiality and adaptivity on the complexity of FSM state identification problems, Proc. ISP RAS, 2018, vol. 30, no. 1, pp. 7–24.

  13. Kushik, N. and Yevtushenko, N., On the length of homing sequences for nondeterministic finite state machines, in Implementation and Application of Automata, Springer, 2013, pp. 220–231.

    MATH  Google Scholar 

  14. Sandberg, S., Homing and synchronizing sequences, in Model-Based Testing of Reactive Systems, Springer, 2005, pp. 5–33.

    Google Scholar 

  15. Bayse, E., Cavalli, A.R., Núñez, M., and Zaïdi, F., A passive testing approach based on invariants: Application to the WAP, Comput. Networks, 2005, vol. 48, no. 2, pp. 247–266.

    Article  Google Scholar 

  16. Kushik, N., El-Fakih, K., and Yevtushenko, N., Preset and adaptive homing experiments for nondeterministic finite state machines, in Implementation and Application of Automata, Springer, 2011, pp. 215–224.

    MATH  Google Scholar 

  17. Kushik, N., El-Fakih, K., and Yevtushenko, N., Adaptive homing and distinguishing experiments for nondeterministic finite state machines, in Testing Software and Systems, Springer, 2013, pp. 33–48.

    MATH  Google Scholar 

  18. Kushik, N. and Yenigün, H., Heuristics for deriving adaptive homing and distinguishing sequences for nondeterministic finite state machines, in Testing Software and Systems, Springer, 2015, pp. 243–248.

    Google Scholar 

  19. Yenigün, H., Yevtushenko, N., and Kushik, N., The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs, Inf. Process. Lett., 2017, vol. 127, pp. 49–53.

    Article  MathSciNet  Google Scholar 

  20. Krichen, M. and Tripakis, S., Conformance testing for real-time systems, Formal Methods Syst. Des., 2009, vol. 34, no. 3, pp. 238–304.

    Article  Google Scholar 

  21. El-Fakih, K., Yevtushenko, N., and Fouchal, H., Testing timed finite state machines with guaranteed fault coverage, Proc. of the 21st IFIP WG 6.1 Int. Conf. on Testing of Software and Communication Systems and 9th Int. FATES Workshop, 2009, pp. 66–80.

  22. Merayo, M., Nunez, M., and Rodriguez, I., Formal testing from timed finite state machines, Comput. Networks: Int. J. Comput. Telecommun. Networking, 2008, vol. 52, no. 2, pp. 432–460.

    Article  Google Scholar 

  23. Bresolin, D., El-Fakih, K., Villa, T., and Yevtushenko, N., Deterministic timed finite state machines: Equivalence checking and expressive power, International Conference GANDALF, 2014, pp. 203–216.

  24. Gromov, M., El-Fakih, K., Shabaldina, N., and Yevtushenko, N., Distinguishing non-deterministic timed finite state machines, in Formal Techniques for Distributed Systems, Springer, 2009, pp. 137–151.

    MATH  Google Scholar 

  25. Tvardovskii, A.S., El-Fakih, K., Gromov, M., and Yevtushenko, N., Testing timed nondeterministic finite state machines with the guaranteed fault coverage, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 724–730.

    Article  Google Scholar 

  26. Tvardovskii, A. and Yevtushenko, N., Deriving homing sequences for Finite State Machines with timed guards, Syst. Inf., 2020, vol. 17, pp. 1–10.

    Google Scholar 

  27. Hartmanis, J. and Stearns, R., Algebraic Structure Theory of Sequential Machines, Prentice-Hall, 1966.

    MATH  Google Scholar 

  28. Vinarskii, E., Tvardovskii, A., Evtushenko, L., and Yevtushenko, N., Deriving adaptive homing sequences for weakly initialized nondeterministic FSMs, 2019 IEEE East-West Design & Test Symposium (EWDTS), IEEE, 2019.

  29. Yevtushenko, N., Kuliamin, V., and Kushik, N., Evaluating the complexity of deriving adaptive homing, synchronizing and distinguishing sequences for nondeterministic FSMs, in Testing Software and Systems, Springer, 2019, pp. 86–103.

    Google Scholar 

  30. Vinarskii, E. and Yevtushenko, N., Evaluating length of a shortest adaptive homing sequence for weakly initialized FSMs, 2020 IEEE East-West Design & Test Symposium (EWDTS), 2020.

  31. Kushik, N. and Yevtushenko, N., Adaptive homing is in P, Electron. Proc. Theor. Comput. Sci., 2015, vol. 180, pp. 73–78.

    Article  Google Scholar 

Download references

Funding

This study was funded by the Russian Foundation for Basic Research, project no. 19-07-00327.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to A. S. Tvardovskii or N. V. Yevtushenko.

Ethics declarations

The authors declare that they have no conflicts of interest.

Additional information

Translated by S. Kuznetsov

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tvardovskii, A.S., Yevtushenko, N.V. Deriving Homing Sequences for Finite State Machines with Timed Guards. Aut. Control Comp. Sci. 55, 738–750 (2021). https://doi.org/10.3103/S0146411621070154

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411621070154

Keywords:

Navigation