Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/13840
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hierons, RM | - |
dc.date.accessioned | 2017-01-11T16:13:29Z | - |
dc.date.available | 2017-01-11T16:13:29Z | - |
dc.date.issued | 2017-01-16 | - |
dc.identifier.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. | en_US |
dc.identifier.issn | 0098-5589 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/13840 | - |
dc.description.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. | en_US |
dc.format.extent | 1033 - 1043 | - |
dc.format.medium | Print-Electronic | - |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | software engineering/software/program verification | en_US |
dc.subject | software engineering/testing and debugging | en_US |
dc.subject | systems and software | en_US |
dc.subject | checking experiment | en_US |
dc.subject | partial finite state machine | en_US |
dc.title | Testing from Partial Finite State Machines without Harmonised Traces | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.1109/TSE.2017.2652457 | - |
dc.relation.isPartOf | IEEE Transactions on Software Engineering | - |
pubs.issue | 11 | - |
pubs.publication-status | Published | - |
pubs.volume | 43 | - |
dc.identifier.eissn | 1939-3520 | - |
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.