STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The synchronization problem in protocol testing and its complexity
Information Processing Letters
Test generation with respect to distributed interfaces
Computer Standards & Interfaces
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
Synchronizable test sequences of finite state machines
Computer Networks and ISDN Systems
Coordination Algorithm for Distributed Testing
The Journal of Supercomputing
Reduced Length Checking Sequences
IEEE Transactions on Computers
A Temporal Approach for Testing Distributed Systems
IEEE Transactions on Software Engineering
Error detection with multiple observers
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
Conformance Testing of Protocol Machines without Reset
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Overcoming observability problems in distributed test architectures
Information Processing Letters
Generalizing redundancy elimination in checking sequences
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Resolving observability problems in distributed test architectures
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Overcoming controllability problems with fewest channels between testers
Computer Networks: The International Journal of Computer and Telecommunications Networking
Testing input/output partial order automata
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 0.00 |
Testing may be used to show that a system under test conforms to its specification. In the case of a distributed system, one may have to use a distributed test architecture, involving p testers in order to test the system under test. These p testers may under some circumstances have to coordinate their actions with each other using external coordination channels. This may require the use of up to p2–p unidirectional coordination channels in the test architecture, which can be an extensive and expensive setup. In this paper, we propose a method to generate checking sequences while minimizing the number of required coordination channels, by adapting existing methods that generate checking sequences to be applied in a centralized test architecture. We consider the case of unidirectional and bidirectional coordination channels, and the case of transitive coordination.