Conformance tests as checking experiments for partial nondeterministic FSM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3997 LNCS, Issue , 2006, Pages 118-133

  Petrenko, Alexandre ^a   Yevtushenko, Nina ^b  

^a Cent de Recherche Informatique de Montreal   (Canada)

^b TOMSK STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTER SOFTWARE; INPUT OUTPUT PROGRAMS;

CONFORMANCE TESTS; NONDETERMINISTIC FSM; QUASI-EQUIVALENCE; QUASI-REDUCTION;

DESIGN FOR TESTABILITY;

EID: 33746768803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11759744_9     Document Type: Conference Paper

References (23)

1. H. AboElFotoh, O. Abou-Rabia, and H. Ural. A Test Generation Algorithm for Protocols Modeled as Non-Deterministic FSMs. The Software Eng. Journal, 1993, 8(4), pp. 184-188.
2. R. Alur, C. Courcoubetis, and M. Yannakakis. Distinguishing Tests for Nondeterministic and Probabilistic Machines. 27th ACM Symp. on Theory of Comp., 1995, pp. 363-372.
3. S. Yu. Boroday. Distinguishing Tests for Non-Deterministic Finite State Machines. Testing of Communicating Systems, IFIP TC6 11th International Workshop on Testing of Communicating Systems, 1998, Kluwer, pp. 101-107.
4. M. Dorofeeva, A. Petrenko, M. Vetrova, and N. Yevtushenko. Adaptive Test Generation from a nondeterministic FSM, Radioelektronika i informatika. 2004, No. 3, pp. 91-95.
5. R. M. Hierons. Adaptive Testing of a Deterministic Implementation against a Nondeterministic Finite State Machine. The Computer Journal, 1998, 41(5), pp. 349-355.
6. R. M. Hierons, Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting, IEEE Transactions on Computers, 2004, 53, 10, pp. 1330-1342.
7. R. M. Hierons. Using Candidates to Test a Deterministic Implementation Against a Non-deterministic Finite State Machine, The Computer Journal, 2003, 46, 3, pp. 307-318.
8. R. M. Hierons and H. Ural. Concerning the Ordering of Adaptive Test Sequences, 23rd IFIP International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2003), 2003, LNCS volume 2767, pp. 289-302.
9. I. Hwang, T. Kim, S. Hong, J. Lee, Test Selection for a Nondeterministic FSM, Computer Communications, 2001, Vol. 24/12, 7, pp.1213-1223.
10. H. Kloosterman, Test Derivation from Non-Deterministic Finite State Machines. Protocol Test Systems, V, Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems, Canada, 1992. North-Holland 1993, pp. 297-308.
11. I. Kufareva, N. Yevtushenko, and A. Petrenko, Design of Tests for Nondeterministic Machines with Respect to Reduction, Automatic Control and Computer Sciences, Allerton Press Inc., USA, No. 3, 1998.
12. G. L. Luo, G. v. Bochmann, and A. Petrenko. Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized Wp-method. IEEE Transactions on Software Engineering, 1994, 20(2), pp. 149-161.
13. G. Luo, A. Petrenko, G. v. Bochmann. Selecting Test Sequences for Partially Specified Nondeterministic Finite State Machines, the IFIP Seventh International Workshop on Protocol Test Systems, Japan, 1994, pp. 95-118.
14. R. Miller, D. Chen, D. Lee, R. Hao. Coping with Nondeterminism in Network Protocol Testing. TestCom 2005.
15. L. Nachmanson, M. Veanes, W. Schulte, N Tillmann, W. Grieskamp, Optimal Strategies for Testing Nondeterministic Systems, ISSTA 2004, Software Engineering Notes ACM, 29, pp. 55-64.
16. A. Petrenko. Checking Experiments with Protocol Machines, Proceedings of the IFIP Fourth International Workshop on Protocol Test Systems, the Netherlands, 1991, pp. 83-94.
17. A. Petrenko, N. Yevtushenko, A. Lebedev, and A. Das. Nondeterministic State Machines in Protocol Conformance Testing, Proceedings of the IFIP Sixth International Workshop on Protocol Test Systems, France, 1993, pp. 363-378.
18. A. Petrenko, N. Yevtushenko, and G. v. Bochmann. Testing Deterministic Implementations from their Nondeterministic Specifications, Proceedings of the IFIP Ninth International Workshop on Testing of Communicating Systems, 1996, pp. 125-140.
19. A. Petrenko and N. Yevtushenko, On Test Derivation from Partial Specifications, Proceedings of the IFIP Joint International Conference, FORTE/PSTV2000, on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, Italy, 2000, pp. 85-102.
20. A. Petrenko and N. Yevtushenko. Testing from Partial Deterministic FSM Specifications, IEEE Transactions on Computers, 2005, Vol. 54, No. 9, pp. 1154-1165.
21. P. Tripathy and K. Naik, Generation of Adaptive Test Cases from Nondeterministic Finite State Models. Protocol Test Systems, V, Proceedings of the IFIP TC6/WG6.1 Fifth International Workshop on Protocol Test Systems, North-Holland 1993, pp. 309-320.
22. F. Zhang and T. Cheung, Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines, IEEE Transactions on Software Engineering, 2003, Vol. 29, No. 1, pp. 1-14.
23. N. Yevtushenko, A. Lebedev, and A. Petrenko. On Checking Experiments with Nondeterministic Automata. Automatic Control and Computer Sciences, 1991, 6, pp. 81-85.