Checking sequences for distributed test architectures |
| |
Authors: | R M Hierons H Ural |
| |
Affiliation: | (1) School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK;(2) School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, K1N 6N5, Canada |
| |
Abstract: | Controllability and observability problems may manifest themselves during the application of a checking sequence in a test
architecture where there are multiple remote testers. These problems often require the use of external coordination message
exchanges among testers during testing. However, the use of coordination messages requires the existence of an external network
that can increase the cost of testing and can be difficult to implement. In addition, the use of coordination messages introduces
delays and this can cause problems where there are timing constraints. Thus, sometimes it is desired to construct a checking
sequence from the specification of the system under test that will be free from controllability and observability problems
without requiring the use of external coordination message exchanges. This paper gives conditions under which it is possible
to produce such a checking sequence, using multiple distinguishing sequences, and an algorithm that achieves this. |
| |
Keywords: | Testing Checking sequence Distributed test architecture Coordination problems Observability problems |
本文献已被 SpringerLink 等数据库收录! |
|