262,621 research outputs found
Testing from a nondeterministic finite state machine using adaptive state counting
The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. This paper extends the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point
Tournament Sequences and Meeussen Sequences
A "tournament sequence" is an increasing sequence of positive integers
(t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an
increasing sequence of positive integers (m_1,m_2,...) such that m_1=1, every
nonnegative integer is the sum of a subset of the {m_i}, and each integer m_i-1
is the sum of a unique such subset.
We show that these two properties are isomorphic. That is, we present a
bijection between tournament and Meeussen sequences which respects the natural
tree structure on each set. We also present an efficient technique for counting
the number of tournament sequences of length n, and discuss the asymptotic
growth of this number. The counting technique we introduce is suitable for
application to other well-behaved counting problems of the same sort where a
closed form or generating function cannot be found.Comment: 16 pages, 1 figure. Minor changes only; final version as published in
EJ
- ā¦