Please use this identifier to cite or link to this item:
Title: Controllable testing from nondeterministic finite state machines with multiple ports
Authors: Hierons, RM
Keywords: Software engineering/software/program verification;Controllability;Distributed test architecture;Finite state machine;Nondeterminism;Software engineering/testing and debugging
Issue Date: 2011
Publisher: IEEE Computer Society
Citation: IEEE Transactions on Computers, 60(12): 1818 - 1822, Dec 2011
Abstract: 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}.
Description: Copyright @ 2011 IEEE
ISSN: 0018-9340
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
dnfsm_final.pdf280.68 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.