Skip to main content
SpringerLink
Log in

Adaptive Experiments for State Identification in Finite State Machines with Timeouts

  • Conference paper
  • First Online:
Machines, Computations, and Universality (MCU 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13419))

Included in the following conference series:

  • 223 Accesses

Abstract

Homing and synchronizing sequences are used for the current state identification in finite state machines (FSMs). Adaptive homing and synchronizing sequences for which the next input depends on the outputs to the previous ones, exist more often and usually are shorter than the preset. Thus, a lot of attention is paid to the existence check, derivation complexity and length of shortest adaptive state identification sequences. In this paper, we adapt the notions of adaptive homing and synchronizing sequences for FSMs with timeouts which are widely used for solving verification and testing problems of components of telecommunication systems. Based on the corresponding FSM abstraction, the procedures for deriving adaptive homing and synchronizing sequences are proposed for FSMs with timeouts when such sequences exist.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw-Hill, New York (1962)

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Hibbard, T.N.: Least upper bounds on minimal terminal state experiments of two classes of sequential machines. J. ACM 8(4), 601–612 (1961)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  5. Wang, H.-E., Tu, K.-H., Jiang, J.-H.R., Kushik, N.: Homing sequence derivation with quantified Boolean satisfiability. In: Yevtushenko, N., Cavalli, A.R., Yenigün, H. (eds.) ICTSS 2017. LNCS, vol. 10533, pp. 230–242. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67549-7_14

    Chapter  Google Scholar 

  6. Yenigün, H., Yevtushenko, N., Kushik, N., López, J.: The effect of partiality and adaptivity on the complexity of FSM state identification problems. Trudy ISP RAN/Proc. ISP RAS 30(1), 7–24 (2018)

    Article  Google Scholar 

  7. Kushik, N., Yevtushenko, N.: On the length of homing sequences for nondeterministic finite state machines. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 220–231. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39274-0_20

    Chapter  MATH  Google Scholar 

  8. Sandberg, S.: 1 homing and synchronizing sequences. In: Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.) Model-Based Testing of Reactive Systems. LNCS, vol. 3472, pp. 5–33. Springer, Heidelberg (2005). https://doi.org/10.1007/11498490_2

    Chapter  Google Scholar 

  9. Kushik, N., López, J., Cavalli, A., Yevtushenko, N.: Improving protocol passive testing through “Gedanken” experiments with finite state machines. In: Proceedings of IEEE International Conference on Software Quality, Reliability and Security, Vienna, Austria, 1–3 August, pp. 315–322. IEEE (2016)

    Google Scholar 

  10. Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Circuit Theory and Logical Design, Princeton, USA, 11–13 November, pp. 95–110. IEEE (1965)

    Google Scholar 

  11. Krichen, M., Tripakis, S.: Conformance testing for real-time systems. Formal Methods Syst. Des. 34, 238–304 (2009)

    Article  Google Scholar 

  12. El-Fakih, K., Yevtushenko, N., Fouchal, H.: Testing timed finite state machines with guaranteed fault coverage. In: Núñez, M., Baker, P., Merayo, M.G. (eds.) FATES/TestCom -2009. LNCS, vol. 5826, pp. 66–80. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-05031-2_5

    Chapter  Google Scholar 

  13. Merayo, M.G., Núñez, M., Rodriguez, I.: Formal testing from timed finite state machines. Comput. Networks 52(2), 432–460 (2008)

    Article  Google Scholar 

  14. Bresolin, D., El-Fakih, K., Villa, T., Yevtushenko, N.: Deterministic timed finite state machines: equivalence checking and expressive power. In: Proceedings of International Conference GANDALF, Verona, Italy, 10–12 September, pp. 203–216 (2014)

    Google Scholar 

  15. Gromov, M., El-Fakih, K., Shabaldina, N., Yevtushenko, N.: Distinguing non-deterministic timed finite state machines. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS/FORTE -2009. LNCS, vol. 5522, pp. 137–151. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02138-1_9

    Chapter  MATH  Google Scholar 

  16. Kushik, N., El-Fakih, K., Yevtushenko, N.: Adaptive homing and distinguishing experiments for nondeterministic finite state machines. In: Yenigün, H., Yilmaz, C., Ulrich, A. (eds.) ICTSS 2013. LNCS, vol. 8254, pp. 33–48. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-41707-8_3

    Chapter  MATH  Google Scholar 

  17. Kushik, N., Yenigün, H.: Heuristics for deriving adaptive homing and distinguishing sequences for nondeterministic finite state machines. In: El-Fakih, K., Barlas, G., Yevtushenko, N. (eds.) ICTSS 2015. LNCS, vol. 9447, pp. 243–248. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25945-1_15

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. Doyen, L., Juhl, L., Larsen, K. G., Markey, N., Shirmohammadi, M.: Synchronizing words for weighted and timed automata. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, New Delhi, 15–17 December. Leibniz International Proceedings in Informatics, vol. 29, pp. 121–132 (2014)

    Google Scholar 

  20. Kushik, N., El-Fakih, K., Yevtushenko, N., Cavalli, A.R.: On adaptive experiments for nondeterministic finite state machines. Int. J. Softw. Tools Technol. Transf. 18(3), 251–264 (2014). https://doi.org/10.1007/s10009-014-0357-7

    Article  MATH  Google Scholar 

  21. Yevtushenko, N., Kuliamin, V., Kushik, N.: Evaluating the complexity of deriving adaptive homing, synchronizing and distinguishing sequences for nondeterministic FSMs. In: Gaston, C., Kosmatov, N., Le Gall, P. (eds.) ICTSS 2019. LNCS, vol. 11812, pp. 86–103. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31280-0_6

    Chapter  Google Scholar 

  22. Kushik, N., El-Fakih, K., Yevtushenko, N.: Preset and adaptive homing experiments for nondeterministic finite state machines. In: Bouchou-Markhoff, B., Caron, P., Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2011. LNCS, vol. 6807, pp. 215–224. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22256-6_20

    Chapter  MATH  Google Scholar 

  23. Petrenko, A., Yevtushenko, N.: Conformance tests as checking experiments for partial nondeterministic FSM. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol. 3997, pp. 118–133. Springer, Heidelberg (2006). https://doi.org/10.1007/11759744_9

    Chapter  Google Scholar 

  24. Kushik, N., Yevtushenko, N.: Adaptive homing is in P. Electron. Proc. Theor. Comput. Sci. 180, 73–78 (2015)

    Article  Google Scholar 

  25. Tvardovskii, A.S., Yevtushenko, N.V.: Deriving homing sequences for finite state machines with timed guards. Aut. Control Comput. Sci. 55, 738–750 (2021)

    Article  Google Scholar 

Download references

Acknowledgements

This work is partly supported by the RSF project № 22-29-01189.

Author information

Authors and Affiliations

  1. National Research Tomsk State University, Tomsk, 634050, Russia

    Aleksandr Tvardovskii

  2. Ivannikov Institute for System Programming of the RAS, Moscow, 109004, Russia

    Nina Yevtushenko

Authors
  1. Aleksandr Tvardovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nina Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aleksandr Tvardovskii .

Editor information

Editors and Affiliations

  1. Université d’Orléans, Orléans, France

    Jérôme Durand-Lose

  2. University of Debrecen, Debrecen, Hungary

    György Vaszil

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tvardovskii, A., Yevtushenko, N. (2022). Adaptive Experiments for State Identification in Finite State Machines with Timeouts. In: Durand-Lose, J., Vaszil, G. (eds) Machines, Computations, and Universality. MCU 2022. Lecture Notes in Computer Science, vol 13419. Springer, Cham. https://doi.org/10.1007/978-3-031-13502-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-13502-6_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-13501-9

  • Online ISBN: 978-3-031-13502-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation