Skip to main content
Log in

Generating Test Sets from Non-Deterministic Stream X-Machines

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

X-machines were proposed by Holcombe as a possible specification language and since then a number of further investigations have demonstrated that the model is intuitive and easy to use as well as general enough to cater for a wide range of applications. In particular (generalised) stream X-machines have been found to be extremely useful as a specification method and most of the theory developed so far has concentrated on this particular class of X-machines. Furthermore, a method for testing systems specified by stream X-machines exists and is proved to detect all faults of the implementation provided that the system meets certain initial requirements. However, this method can only be used to generate test sequences from deterministic X-machine specifications. In this paper we present the theoretical basis for a method for generating test sets from non-deterministic generalised stream X-machines.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 1999 / Accepted in revised form September 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ipate, F., Holcombe, M. Generating Test Sets from Non-Deterministic Stream X-Machines. Formal Aspects of Computing 12, 443–458 (2000). https://doi.org/10.1007/s001650070004

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650070004

Navigation