The Community for Technology Leaders
Green Image
Issue No. 12 - December (2011 vol. 60)
ISSN: 0018-9340
pp: 1818-1822
Robert M. Hierons , Brunel University
Some systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are using the distributed test architecture. It is known that this test architecture introduces controllability problems when testing from a deterministic finite state machine. This paper investigates the problem of testing from a nondeterministic finite state machine in the distributed test architecture and explores controllability. It shows how we can decide in polynomial time whether an input sequence is controllable. It also gives an algorithm for generating such an input sequence \bar{x} and shows how we can produce testers that implement \bar{x}.
Software engineering/software/program verification, software engineering/testing and debugging, finite state machine, nondeterminism, controllability, distributed test architecture.

R. M. Hierons, "Controllable Testing from Nondeterministic Finite State Machines with Multiple Ports," in IEEE Transactions on Computers, vol. 60, no. , pp. 1818-1822, 2010.
87 ms
(Ver 3.3 (11022016))