Skip to main content
SpringerLink
Log in

Conformance Tests as Checking Experiments for Partial Nondeterministic FSM

  • Conference paper
Book cover Formal Approaches to Software Testing (FATES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3997))

Included in the following conference series:

Abstract

The paper addresses the problem of conformance test generation from input/output FSMs that might be partially specified and nondeterministic. Two conformance relations are considered, quasi-reduction and quasi-equivalence. The former requires that in response to each input sequence defined in a specification FSM, a conforming implementation FSM produces only output sequences of the specification FSM, while the latter is stronger: a conforming implementation FSM must produce all of them and nothing else. For each relation, a test generation method is elaborated. The resulting tests are proven to be complete, i.e., sound and exhaustive, for a given bound on the number of states; they include as special cases checking experiments for deterministic FSMs.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. AboElFotoh, H., Abou-Rabia, O., Ural, H.: A Test Generation Algorithm for Protocols Modeled as Non-Deterministic FSMs. The Software Eng. Journal 8(4), 184–188 (1993)

    Article  Google Scholar 

  2. Alur, R., Courcoubetis, C., Yannakakis, M.: Distinguishing Tests for Nondeterministic and Probabilistic Machines. In: 27th ACM Symp. on Theory of Comp., pp. 363–372 (1995)

    Google Scholar 

  3. Boroday, S.Y.: Distinguishing Tests for Non-Deterministic Finite State Machines. In: Testing of Communicating Systems, IFIP TC6 11th International Workshop on Testing of Communicating Systems, pp. 101–107. Kluwer, Dordrecht (1998)

    Google Scholar 

  4. Dorofeeva, M., Petrenko, A., Vetrova, M., Yevtushenko, N.: Adaptive Test Generation from a nondeterministic FSM. Radioelektronika i informatika 3, 91–95 (2004)

    Google Scholar 

  5. Hierons, R.M.: Adaptive Testing of a Deterministic Implementation against a Nondeterministic Finite State Machine. The Computer Journal 41(5), 349–355 (1998)

    Article  MATH  Google Scholar 

  6. Hierons, R.M.: Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting. IEEE Transactions on Computers 53(10), 1330–1342 (2004)

    Article  Google Scholar 

  7. Hierons, R.M.: Using Candidates to Test a Deterministic Implementation Against a Non-deterministic Finite State Machine. The Computer Journal 46(3), 307–318 (2003)

    Article  MATH  Google Scholar 

  8. Hierons, R.M., Ural, H.: Concerning the Ordering of Adaptive Test Sequences. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 289–302. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Hwang, T., Kim, S., Hong, J.: Test Selection for a Nondeterministic FSM. Computer Communications 24/12(7), 1213–1223 (2001)

    Article  Google Scholar 

  10. Kloosterman, H.: Test Derivation from Non-Deterministic Finite State Machines. In: Protocol Test Systems, V, Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems, Canada, 1992, pp. 297–308. North-Holland, Amsterdam (1993)

    Google Scholar 

  11. Kufareva, I., Yevtushenko, N., Petrenko, A.: Design of Tests for Nondeterministic Machines with Respect to Reduction. Automatic Control and Computer Sciences 3 (1998)

    Google Scholar 

  12. Luo, G.L., Bochmann, G.v., Petrenko, A.: Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-method. IEEE Transactions on Software Engineering 20(2), 149–161 (1994)

    Article  Google Scholar 

  13. Luo, G., Petrenko, A., Bochmann, G.v.: Selecting Test Sequences for Partially Specified Nondeterministic Finite State Machines. In: the IFIP Seventh International Workshop on Protocol Test Systems, Japan, pp. 95–118 (1994)

    Google Scholar 

  14. Miller, R., Chen, D., Lee, D., Hao, R.: Coping with Nondeterminism in Network Protocol Testing. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol. 3502, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Nachmanson, L., Veanes, M., Schulte, W., Tillmann, N., Grieskamp, W.: Optimal Strategies for Testing Nondeterministic Systems. In: ISSTA 2004, Software Engineering Notes, vol. 29, pp. 55–64. ACM, New York (2004)

    Google Scholar 

  16. Petrenko, A.: Checking Experiments with Protocol Machines. In: Proceedings of the IFIP Fourth International Workshop on Protocol Test Systems, The Netherlands, pp. 83–94 (1991)

    Google Scholar 

  17. Petrenko, A., Yevtushenko, N., Lebedev, A., Das, A.: Nondeterministic State Machines in Protocol Conformance Testing. In: Proceedings of the IFIP Sixth International Workshop on Protocol Test Systems, France, pp. 363–378 (1993)

    Google Scholar 

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

  19. Petrenko, A., Yevtushenko, N.: On Test Derivation from Partial Specifications. In: Proceedings of the IFIP Joint International Conference, FORTE/PSTV 2000, on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, Italy, pp. 85–102 (2000)

    Google Scholar 

  20. Petrenko, A., Yevtushenko, N.: Testing from Partial Deterministic FSM Specifications. IEEE Transactions on Computers 54(9), 1154–1165 (2005)

    Article  Google Scholar 

  21. Tripathy, P., Naik, K.: Generation of Adaptive Test Cases from Nondeterministic Finite State Models. In: Protocol Test Systems, V, Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems, pp. 309–320. North-Holland, Amsterdam (1993)

    Google Scholar 

  22. Zhang, F., Cheung, T.: Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines. IEEE Transactions on Software Engineering 29(1), 1–14 (2003)

    Article  Google Scholar 

  23. Yevtushenko, N., Lebedev, A., Petrenko, A.: On Checking Experiments with Nondeterministic Automata. Automatic Control and Computer Sciences 6, 81–85 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIM, Centre de recherche informatique de Montréal, 550 Sherbrooke Street West, Suite 100, Montreal, H3A 1B9, Canada

    Alexandre Petrenko

  2. Tomsk State University, 36 Lenin Street, Tomsk, 634050, Russia

    Nina Yevtushenko

Authors
  1. Alexandre Petrenko
    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

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, WA, USA

    Wolfgang Grieskamp

  2. Ericsson Deutschland GmbH, 52134, Herzogenrath, Germany

    Carsten Weise

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petrenko, A., Yevtushenko, N. (2006). Conformance Tests as Checking Experiments for Partial Nondeterministic FSM. In: Grieskamp, W., Weise, C. (eds) Formal Approaches to Software Testing. FATES 2005. Lecture Notes in Computer Science, vol 3997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759744_9

Download citation

  • DOI: https://doi.org/10.1007/11759744_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34454-4

  • Online ISBN: 978-3-540-34455-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation