Bounded sequence testing from non-deterministic finite state machines

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

Volumn 3964 LNCS, Issue , 2006, Pages 55-70

  Ipate, Florentin ^a  

^a UNIVERSITY OF PITESTI   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA PROCESSING; NUMERICAL METHODS; SPECIFICATIONS;

BOUNDED SEQUENCES; FINITE STATE MACHINES; FSM SPECIFICATIONS; IMPLEMENTATION UNDER TESTS; INPUT SEQUENCE; NON-DETERMINISTIC FINITE STATE MACHINE; ON STATE; STATE COUNTING; UPPER BOUND;

NETWORK PROTOCOLS; LOGIC CIRCUITS;

EID: 33745911146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11754008_4     Document Type: Conference Paper

References (14)

1. Campeanu, C., Santean, N., Yu, S. Minimal cover automata for finite languages. Theoretical Computer Science, 267, 3-16 (1999)
2. Chow, T. S. Testing software design modeled by finite state machines, IEEE Transactions on Software Engineering, 4(3), 178-187 (1978)
3. Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M. and Ghedamsi A. Test Selection Based on Finite State Models. IEEE Transactions on Software Engineering, 17(6), 591-603 (1991)
4. Hierons, R. M. Adaptive testing of a deterministic implementation against a non-deterministic finite state machine. The Computer Journal, 41(5), 349-355 (1998)
5. Hierons, R. M. Testing from a Non-Deterministic Finite State Machine Using Adaptive State Counting. IEEE Transactions on Computers 53(10), 1330-1342 (2004)
6. Holcombe, M., Ipate, F. Correct Systems: Building a Business Process Solution. Springer Verlag, Berlin (1998)
7. Ipate, F. On the Minimality of Finite Automata and Stream X-machines for Finite Languages, The Computer Journal, 48(2), 157-167 (2005)
8. Ipate, F. Bounded Sequence Test Selection from Finite State Machines, submitted.
9. Lee, D. and Yannakakis, M. Principles and Methods of Testing Finite State Machines - A Survey. Proceedings of the IEEE, 84(8), 1090-1123 (1996)
10. Luo, G. L., Bochmann, G. v. and 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)
11. Petrenko, A., Yevtushenko, N., Lebedev, A. and Das, A. Nondeterministic state machines in protocol conformance testing. In Proc. of Protocol Test Systems, VI (C-19), Pau, France, 28-30 September, Elsevier Science, 363-378 (1994)
12. Petrenko, A., Yevtushenko, N., Bochmann G.v. Testing deterministic implementations from nondeterministic FSM specifications. In Proc. of 9th International Workshop on Testing of Communicating Systems (IWTCS'96), Darmstadt, Germany, 9-11 September 1996, Chapman and Hall, 125-140 (1996)
13. Sidhu, D. and Leung, T. Formal methods for protocol testing: A detailed study. IEEE Transactions on Software Engineering, 15(4), 413-426, 1989.
14. Yevtushenko, N. V., Lebedev, A. V. and Petrenko, A. F. On checking experiments with nondeterministic automata. Automatic Control and Computer Sciences, 6, 81-85 (1991)