Hierons, R. orcid.org/0000-0002-4771-1446 (2019) FSM quasi-equivalence testing via reduction and observing absence. Science of Computer Programming, 177. pp. 1-18. ISSN 0167-6423
Abstract
There has been significant interest in automatically generating test cases from a non-deterministic finite state machine (FSM). Most approaches check that the behaviours of the system under test (SUT) are allowed by the specification FSM; they therefore test for reduction. However, sometimes one wants all of the behaviours, and so features, of the specification to be implemented and then one is testing for equivalence. In this paper we first note that in order to test for equivalence one must effectively be able to observe the SUT not being able to produce an output $y$ in response to an input $x$ after trace $\sigma$; we model this as the absence of an output. We prove that the problem of testing for equivalence to FSM $M$ can be mapped to testing for reduction to an FSM $R(M)$ that extends $M$ with absences. Thus, one can use techniques developed for testing for reduction when testing for equivalence. We then consider the case where the specification is partial, generalising the result to quasi-equivalence. These results are proved for observable specifications and so we also show how a partial FSM can be mapped to an observable partial FSM from which we can test.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2019 Elsevier. This is an author produced version of a paper subsequently published in Science of Computer Programming. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). |
Keywords: | Conformance testing; Partial finite state machine; Testing for equivalence; Observable finite state machine |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 26 Mar 2019 09:29 |
Last Modified: | 19 Nov 2021 11:59 |
Status: | Published |
Publisher: | Elsevier |
Refereed: | Yes |
Identification Number: | 10.1016/j.scico.2019.03.004 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:143554 |