Please use this identifier to cite or link to this item:
|Title:||Distinguishing Sequences for Distributed Testing: Adaptive Distinguishing Sequences|
|Keywords:||Finite state machine;Distributed test architecture;Distinguishing sequences|
|Publisher:||Oxford University Press (OUP): Policy A - Oxford Open Option A|
|Citation:||The Computer Journal, (2009)|
|Abstract:||This paper concerns the problem of testing from a finite state machine (FSM) M modelling a system that interacts with its environment at multiple physically distributed interfaces, called ports. We assume that the distributed test architecture is used: there is a local tester at each port, the tester at port p only observes events at p, and the testers do not interact during testing. This paper formalises the notion of an adaptive test strategy and what it means for an adaptive test strategy to be controllable. We provide algorithms to check whether a global strategy is controllable and to generate a controllable adaptive distinguishing sequence (ADS). We prove that controllable ADS existence is PSPACE-hard and that the problem of deciding whether M has a controllable ADS with length l is NP-hard. In practice, there is likely to be a polynomial upper bound on the length of ADS in which we are interested and for this case the decision problem is NP-complete.|
|Appears in Collections:||Dept of Computer Science Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.