Fulltext (2).pdf (1.32 MB)
Download file

Parallel Algorithms for Generating Harmonised State Identifiers and Characterising Sets

Download (1.32 MB)
journal contribution
posted on 08.04.2020, 15:30 by Robert M Hierons, Uraz Cengiz Turker
Many automated finite state machine (FSM) based test generation algorithms require that a characterising set or a set of harmonised state identifiers is first produced. The only previously published algorithms for partial FSMs were brute-force algorithms with exponential worst case time complexity. This paper presents polynomial time algorithms and also massively parallel implementations of both the polynomial time algorithms and the brute-force algorithms. In the experiments the parallel algorithms scaled better than the sequential algorithms and took much less time. Interestingly, while the parallel version of the polynomial time algorithm was fastest for most sizes of FSMs, the parallel version of the brute-force algorithm scaled better due to lower memory requirements.

Funding

Funding Agency: 10.13039/501100004410-Scientific and Technological Research Council of Turkey; 10.13039/100007065-NVIDIA corporation;

History

Citation

IEEE Transactions on Computers ( Volume: 65 , Issue: 11 , Nov. 1 2016 )

Version

AM (Accepted Manuscript)

Published in

IEEE Transactions on Computers

Volume

65

Issue

11

Pagination

3370 - 3383

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

issn

0018-9340

Copyright date

2016

Available date

25/02/2016

Publisher version

https://ieeexplore.ieee.org/abstract/document/7415960

Language

en