Abstract
Stream X-machines are a formalisation of extended finite state machines that have been used to specify systems. One of the great benefits of using stream X-machines, for the purpose of specification, is the associated test generation technique which produces a test that is guaranteed to determine correctness under certain design for test conditions. This test generation algorithm has recently been extended to the case where the specification is non-deterministic. However, the algorithms for testing from a non-deterministic stream X-machine currently have limitations: either they test for equivalence, rather than conformance or they restrict the source of non-determinism allowed in the specification. This paper introduces a new test generation algorithm that overcomes both of these limitations, for situations where the implementation is known to be deterministic.
| Original language | English |
|---|---|
| Pages (from-to) | 191-233 |
| Number of pages | 43 |
| Journal | Journal of Theoretical Computer Science |
| Volume | 323 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 14 Sept 2004 |