Generating candidates when testing a deterministic implementation against a non-deterministic finite-state machine

Computer Journal

Volumn 46, Issue 3, 2003, Pages 307-318

  Hierons, R M ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; FUNCTION EVALUATION; OPTIMIZATION; SET THEORY; THEOREM PROVING;

ADAPTIVE TEST PROCESS; FINITE STATE MACHINE;

FINITE AUTOMATA;

EID: 0038529735     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.3.307     Document Type: Article

References (21)

1. Iyengar, V. and Chakrabarty, K. (1998) An efficient finite-state machine implementation of Huffman decoders. Inform. Process. Lett., 64, 271-275.
2. Tanenbaum, A. S. (1996) Computer Networks (3rd edn). Prentice-Hall International Editions, Prentice-Hall, London.
3. ITU-T (1999) Recommendation Z. 100 Specification and Description Language (SDL). International Telecommucations Union, Geneva, Switzerland.
4. Harel, D. and Politi, M. (1998) Modeling Reactive Systems with Statecharts: the STATEMATE Approach. McGraw-Hill, New York.
5. Luo, G., von Bochmann, G. and Petrenko, A. (1994) Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Trans. Software Eng., 20, 149-162.
6. Petrenko, A., Yevtushenko, N., Lebedev, A. and Das, A. (1994) Nondeterministic state machines in protocol conformance testing. In Proceedings of Protocol Test Systems, VI (C-19), Pau, France, 28-30 September, 1994, pp. 363-378. Elsevier Science, Amsterdam.
7. Petrenko, A., Yevtushenko, N. and v. Bochmann, G. (1996) Testing deterministic implementations from nondeterministic FSM specifications. In Testing of Communicating Systems, IFIP TC6 9th International Workshop on Testing of Communicating Systems, Darmstadt, Germany, 9-11 September, 1996, pp. 125-141. Chapman and Hall, London.
8. Hierons, R. M. (1998) Adaptive testing of a deterministic implementation against a nondeterministic finite state machine. Computer J., 41, 349-355.
9. Rabin, M. O. and Scott, D. (1959) Finite automata and their decision problems. IBM J. Res. Develop., 3, 114-125.
10. Starke, P. H. (1972) Abstract Automata. Elsevier, Amsterdam.
11. ITU-T (1997) Recommendation Z.500 Framework on Formal Methods in Conformance Testing. International Telecommunationications Union, Geneva, Switzerland.
12. Gaudel, M. C. (1995) Testing can be formal too. Lecture Notes Comput. Sci., 915, 82-96.
13. Chow, T. S. (1978) Testing software design modelled by finite state machines. IEEE Trans. Software Eng., 4, 178-187.
14. Hennie, F. C. (1964) Fault-detecting experiments for sequential circuits. In Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design. Princeton, NJ, November, 1964, pp. 95-110.
15. Ural, H., Saleh, K. and Williams, A. (2000) Test generation based on control and data dependencies within system specifications in SDL. Comput. Commun., 23, 609-627.
16. Ural, H. and Zhu, K. (1993) Optimal length test sequence generation using distinguishing sequences. IEEE/ACM Trans. Network., 1, 358-371.
17. Vasilevskii, M. P. (1973) Failure diagnosis of automata. Cybernetics, 4, 653-665.
18. Boroday, S. Yu. (1998) Distinguishing tests for nondeterministic finite state machines. In Testing of Communicating Systems, IFIP TC6 11th International Workshop on Testing of Communicating Systems, Tomsk, Russia, 31 August-2 September, 1998, pp. 101-107. Kluwer Academic Press, Boston.
19. Gill, A. (1962) Introduction to the Theory of Finite State Machines. McGraw-Hill, New York.
20. Kam, T., Villa, T., Brayton, R. K. and Sangiovanni-Vincentelli, A. L. (1996) Synthesis of Finite State Machines: Functional Optimization. Kluwer Academic Press, Boston.
21. Cohen, D. I. (1997) Introduction to Computer Theory (2nd edn). John Wiley and Sons, New York.