Introduction to algorithms
Test generation with respect to distributed interfaces
Computer Standards & Interfaces
Synchronizable test sequences based on multiple UIO sequences
IEEE/ACM Transactions on Networking (TON)
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
Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports
Proceedings of the IFIP TC6/WG6.1 Sixth International Workshop on Protocol Test systems VI
Test Architectures for Distributed Systems: State of the Art and Beyond
IWTCS Proceedings of the IFIP TC6 11th International Workshop on Testing Communicating Systems
Architectures for Testing Distributed Systems
Proceedings of the IFIP TC6 12th International Workshop on Testing Communicating Systems: Method and Applications
Minimizing coordination channels in distributed testing
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
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
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 |
When testing a system that has multiple physically distributed ports/interfaces it is normal to place a tester at each port. Each tester observes only the events at its port and it is known that this can lead to additional controllability problems. While such controllability problems can be overcome by the exchange of external coordination messages between the testers, this requires the deployment of an external network and may thus increase the costs of testing. The problem studied in this paper is finding a minimum number of coordination channels to overcome controllability problems in distributed testing. Three instances of this problem are considered. The first problem is to find a minimum number of channels between testers in order to overcome the controllability problems in a given test sequence to be applied in testing. The second problem is finding a minimal set of channels that allow us to overcome controllability problems in any test sequence that may be selected from the specification of the system under test. The last problem is to find a test sequence that achieves a particular test objective and in doing so allows fewest channels to be used.