Skip to main content
SpringerLink
Log in

Synthesis of distinguishing test cases for timed finite state machines

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

This paper is devoted to the generation of distinguishing experiments with completely specified timed finite state machines. It is shown, in particular, that two completely specified nondeterministic finite state machines can be distinguished by a multiple preset experiment if and only if these finite state machines are not equivalent. Two finite state machines can be distinguished by a simple adaptive experiment if and only if they are r-distinguishable, i.e., have no common completely specified reduction. The corresponding adaptive experiment is described by a special timed finite state machine. The procedure for constructing such an r-distinguishing timed finite state machine is proposed.

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

Similar content being viewed by others

References

  1. Alur, R. and Dill, D.L., A Theory of Timed Automata, Theor. Comput. Sci., 1994, vol. 126, no. 2, pp. 183–235.

    Article  MATH  MathSciNet  Google Scholar 

  2. En-Nouaary, A., Dssouli, R., and Khendek, F., Timed Wp-Method: Testing Real-Time Systems, IEEE TSE, 2002, vol. 28, no. 11, pp. 1023–1038.

    Google Scholar 

  3. Springintveld, J., Vaandrager, F., and D’Argenio, P., Testing Timed Automata, Theor. Comput. Sci., 2001, vol. 254, no. 1–2, pp. 225–257.

    Article  MATH  MathSciNet  Google Scholar 

  4. Merayo, M.G., Nu’ñez, M., and Rodriguez, I., Extending EFSMs to Specify and Test Timed Systems with Action Durations and Time-outs, IEEE Trans. on Comput., 2008, vol. 57, no. 6, pp. 835–844.

    Article  Google Scholar 

  5. Merayo, M.G., Nu’ñez, M., and Rodriguez, I., Formal Testing from Timed Finite State Machines, Comput. Networks, 2008, vol. 52, no. 2, pp. 432–460.

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Gromov, M.L., A Method of Construction of Complete Verifying Test for Input-Output Automata, Vestn. Tomskogo Gos. Univ., Control, Computers and Informatics, 2008, vol. 3, no. 4, pp. 85–98.

    Google Scholar 

  8. Alur, R., Courcoubetis, C., and Yannakakis, M., Distinguishing Tests for Nondeterministic and Probabilistic Machines, Proc. of the 27th ACM Symp. on Theory of Computing, 1995, pp. 363–372.

  9. Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, 1980, vol. 92.

  10. Petrenko, A., Yevtushenko, N., and von Bochmann, G., Testing Deterministic Implementations from their Nondeterministic Specifications, Proc. of the IFIP Ninth Int. Workshop on Testing of Communicating Systems, 1996, pp. 125–140.

  11. Yevtushenko, N.V., Petrenko, A.F., and Vetrova, M.V., Nedeterminirovannye avtomaty: analiz i sintez. Chast’ 1. Otnosheniya i operatsii. Uchebnoe posobie (Nondeterministic Automata: Analysis and Synthesis. Part 1: Relations and Operations. Textbook), Tomsk: TGU, 2006.

    Google Scholar 

  12. Starke, P., Abstract automata, American Elsevier, 1972.

  13. Kondrat’eva, O.V. and Gromov, M.L., Observable Form of Timed Automata, 6th All-Siberian Congress for Women Mathematicians (S.V. Kovalevskaya’s Birthday), Krasnoyarsk: RITs SibGTU, 2010, pp. 210–214.

    Google Scholar 

  14. Gromov, M., El-Fakih, Kh., Shabaldina, N., and Yevtushenko, N., Distinguishing Non-deterministic Timed Finite State Machines, Lecture Notes in Computer Science, 2009, vol. 5522, pp. 137–151.

    Article  Google Scholar 

  15. Hierons, R.M., Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting, IEEE Trans. Comput., 2004, vol. 53, no. 10, pp. 1330–1342.

    Article  Google Scholar 

  16. Hierons, R.M., Using Candidates to Test a Deterministic Implementation against a Non-Deterministic Finite State Machine, The Comput. J., 2003, vol. 46, no. 3, pp. 307–318.

    Article  MATH  Google Scholar 

  17. Hierons, R.M., Adaptive Testing of a Deterministic Implementation against a Nondeterministic Finite State Machine, The Comput. J., 1998, vol. 41, no. 5, pp. 349–355.

    Article  MATH  Google Scholar 

  18. Petrenko, A. and Yevtushenko, N., Conformance Tests as Checking Experiments for Partial Nondeterministic FSM, Lecture Notes in Computer Science (Proc. of the 5th Int. Workshop on Formal Approaches to Testing of Software), 2005, vol. 3997, pp. 118–133.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tomsk State University, pr. Lenina 36, Tomsk, 634050, Russia

    M. L. Gromov & N. V. Yevtushenko

Authors
  1. M. L. Gromov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. V. Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. L. Gromov.

Additional information

Original Russian Text © M.L. Gromov, N.V. Yevtushenko, 2010, published in Programmirovanie, 2010, Vol. 36, No. 4.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gromov, M.L., Yevtushenko, N.V. Synthesis of distinguishing test cases for timed finite state machines. Program Comput Soft 36, 216–224 (2010). https://doi.org/10.1134/S0361768810040043

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768810040043

Keywords

Search

Navigation