Please use this identifier to cite or link to this item:
|Title:||Parallel algorithms for generating harmonised state identifiers and characterising sets|
|Keywords:||Software engineering/software/program verification;Software engineering/testing and debugging;Software engineering/test design;Finite state machine;Characterising sets;Harmonised state identifiers;General purpose graphics processing units|
|Publisher:||Institute of Electrical and Electronics Engineers (IEEE)|
|Citation:||IEEE Transactions on Computers, Forthcooming, (2016)|
|Abstract:||Many automated finite state machine (FSM) based test generation algorithms require that a characterising set (CS) or a set of harmonised state identifiers (HSIs) 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.|
|Appears in Collections:||Dept of Computer Science Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.