Paper Info
Title
Adaptive Testing of Nondeterministic Systems with FSM
Abstract
The paper addresses the problem of testing systems considered as black boxes and modelled by Finite State Machines (FSM). While the theory of testing from deterministic FSMs has received a lot of attention, testing from nondeterministic machines is not yet investigated to the same extend. The paper is devoted to the problem of generation of adaptive test cases for nondeterministic specification FSMs to obtain complete, i.e., sound and exhaustive, test suites. Such tests verify that an implementation conforms to its specification, when the conformance relation is the reduction (trace inclusion) relation. A method for deriving a complete test suite is proposed. In case, when the implementation under test is also nondeterministic, each test case is adaptively executed a predefined number of times ensuring that all nondeterministic choices were taken. Comparison with the existing approaches indicates that the method has several advantages.
Year
DOI
Venue
2014
10.1109/HASE.2014.39
High-Assurance Systems Engineering
Keywords
Field
DocType
complete test suite,adaptive test case,nondeterministic machine,deterministic fsms,nondeterministic specification fsms,test suite,finite state machines,conformance relation,nondeterministic systems,nondeterministic choice,adaptive testing,test case,formal specification
Test suite,Nondeterministic finite automaton,Nondeterministic algorithm,Computer science,Deterministic finite automaton,Formal specification,Real-time computing,Finite-state machine,Conformance testing,Computerized adaptive testing
Conference
ISSN
Citations 
PageRank 
1530-2059
5
0.43
References 
Authors
10
2
Name
Order
Citations
PageRank
A. Petrenko156531.37
Nina Yevtushenko266463.45