A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMs
2017
ACM Transactions on Software Engineering and Methodology
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 sequence 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 paper develops a massively parallel algorithm, which can be
doi:10.1145/3051121
fatcat:joxeccrgyzbfbfmqr7orr7ntme