FullText (1).pdf (4.61 MB)
Download file

Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs

Download (4.61 MB)
journal contribution
posted on 08.04.2020, 15:20 by Robert M Hierons, Uraz Cengiz Türker
A distinguishing sequence (DS) for a finite-state machine (FSM) is an input sequence that distinguishes every pair of states of the FSM. There are techniques that generate a test sequence with guaranteed fault detection power, and it has been found that shorter test sequences can be produced if DSs are used. Despite these benefits, however, until recently the only published DS generation algorithms have been for deterministic FSMs. This article develops a massively parallel algorithm, which can be used in Graphics Processing Units (GPUs) Computing, to generate DSs from partial observable non-deterministic FSMs. We also present the results of experiments using randomly generated FSMs and some benchmark FSMs. The results are promising and indicate that the proposed algorithm can derive DSs from partial observable non-deterministic FSMs with 32,000 states in an acceptable amount of time.

Funding

Funding Sources NVIDIA corporation Scientific and Technological Research Council of Turkey (TÜBİTAK)

History

Citation

ACM Transactions on Software Engineering and Methodology Volume 26, Issue 1 July 2017

Version

AM (Accepted Manuscript)

Published in

ACM Transactions on Software Engineering and Methodology

Volume

26

Issue

1

Pagination

1 - 34

Publisher

Association for Computing Machinery (ACM)

issn

1049-331X

Acceptance date

01/01/2017

Copyright date

2017

Available date

12/07/2017

Publisher version

https://dl.acm.org/doi/abs/10.1145/3051121

Language

en