Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/13840
Title: | Testing from Partial Finite State Machines without Harmonised Traces |
Authors: | Hierons, RM |
Keywords: | software engineering/software/program verification;software engineering/testing and debugging;systems and software;checking experiment;partial finite state machine |
Issue Date: | 16-Jan-2017 |
Publisher: | IEEE |
Citation: | Hierons, R.M. (2017) 'Testing from Partial Finite State Machines without Harmonised Traces,' IEEE Transactions on Software Engineering, 43, (11), pp. 1033 - 1043, doi: 10.1109/TSE.2017.2652457. |
Abstract: | This paper concerns the problem of testing from a partial, possibly non-deterministic, finite state machine (FSM) S. Two notions of correctness (quasi-reduction and quasi-equivalence) have previously been defined for partial FSMs but these, and the corresponding test generation techniques, only apply to FSMs that have harmonised traces. We show how quasi-reduction and quasi equivalence can be generalised to all partial FSMs. We also consider the problem of generating an m-complete test suite from a partial FSM S: a test suite that is guaranteed to determine correctness as long as the system under test has no more than m states. We prove that we can complete S to form a completely-specified non-deterministic FSM S0 such that any m-complete test suite generated from S0 can be converted into an m-complete test suite for S. We also show that there is a correspondence between test suites that are reduced for S and S0 and also that are minimal for S and S0. |
URI: | https://bura.brunel.ac.uk/handle/2438/13840 |
DOI: | https://doi.org/10.1109/TSE.2017.2652457 |
ISSN: | 0098-5589 |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 263.93 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.