Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine

Author: Hierons R.M.1

Source: Computer Journal, Volume 46, Number 3, May 2003 , pp. 307-318(12)

Publisher: Oxford University Press

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Abstract:

This paper considers the problem of testing a deterministic system against a non-deterministic finite-state machine. An adaptive test process, with two phases, is proposed. The paper focuses on the first stage which involves testing to generate a candidate deterministic finite-state machine. This candidate has the property that, under the test hypotheses used, the implementation is correct if and only if it is equivalent to the candidate. A test may then be derived from the candidate.

Document Type: Research article

Affiliations: 1: Brunel University, Uxbridge, Middlesex, UK rob.hierons@brunel.ac.uk

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$34.56 plus tax

 

OR

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A