Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.identifier.citationIEEE Transactions on Computers, 60(12): 1818 - 1822, Dec 2011en_US
dc.descriptionCopyright @ 2011 IEEEen_US
dc.description.abstractSome 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}.en_US
dc.publisherIEEE Computer Societyen_US
dc.subjectSoftware engineering/software/program verificationen_US
dc.subjectDistributed test architectureen_US
dc.subjectFinite state machineen_US
dc.subjectSoftware engineering/testing and debuggingen_US
dc.titleControllable testing from nondeterministic finite state machines with multiple portsen_US
pubs.organisational-data/Brunel/Brunel (Active)-
pubs.organisational-data/Brunel/Brunel (Active)/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Research Centres (RG)-
pubs.organisational-data/Brunel/Research Centres (RG)/CIKM-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)/CIKM-
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.