Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/8832
Title: Controllability problems in MSC-based testing
Authors: Dan, H
Hierons, RM
Keywords: Testing;Controllability problems;Message sequence charts;Race;Non-local choice
Issue Date: 2012
Publisher: Oxford University Press
Citation: The Computer Journal, 55(11), 1270 - 1287, 2012
Abstract: In testing systems with distributed interfaces/ports, we may place a separate tester at each port. It is known that this approach can introduce controllability problems which have received much attention in testing from finite state machines. Message sequence charts (MSCs) form an alternative, commonly used, language for modelling distributed systems. However, controllability problems in testing from MSCs have not been thoroughly investigated. In this paper, controllability problems in MSC test cases are analysed with three notions of observability: local, tester and global. We identify two types of controllability problem in MSC-based testing. It transpires that each type of controllability problem is related to a type of MSC pathology. Controllability problems of timing are caused by races but not every race causes controllability problems; controllability problems of choice are caused by non-local choices and not every non-local choice causes controllability problems. We show that some controllability problems of timing are avoidable and some controllability problems of choice can be overcome when testers have better observational power. Algorithms are provided to tackle both types of controllability problems. Finally, we show how one can overcome controllability problems using a coordination service with status messages based on algorithms developed in this paper.
Description: This is a pre-copyedited, author-produced PDF of an article accepted for publication in The Computer Journal following peer review. The definitive publisher-authenticated version [Dan, H and Hierons, RM (2012), "Controllability Problems in MSC-Based Testing", The Computer Journal, 55(11), 1270-1287] is available online at: http://comjnl.oxfordjournals.org/content/55/11/1270. Copyright @ The Authors 2011.
URI: http://comjnl.oxfordjournals.org/content/55/11/1270
http://bura.brunel.ac.uk/handle/2438/8832
DOI: http://dx.doi.org/10.1093/comjnl/bxr125
ISSN: 1460-2067
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf529.43 kBAdobe PDFView/Open


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