Resolving observability problems in distributed test architectures

Authors:
J. Chen;R. M. Hierons;H. Ural
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, Canada;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, United Kingdom;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 8
Cited 8

A protocol test generation procedure

Computer Networks and ISDN Systems
The synchronization problem in protocol testing and its complexity

Information Processing Letters
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
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
Observation Inaccuracy in Conformance Testing with Multiple Testers

ASSET '98 Proceedings of the 1998 IEEE Workshop on Application - Specific Software Engineering and Technology
Fault detecting experiments for sequential circuits

SWCT '64 Proceedings of the 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design

A new method of generating synchronizable test sequences that detect output-shifting faults based on multiple UIO sequences

Proceedings of the 2006 ACM symposium on Applied computing
Overcoming controllability problems with fewest channels between testers

Computer Networks: The International Journal of Computer and Telecommunications Networking
Using status messages in the distributed test architecture

Information and Software Technology
Testing k-Safe Petri Nets

TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Testing in the distributed test architecture

Formal methods and testing
Detecting observability problems in distributed testing

TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The introduction of multiple remote testers to apply a test or checking sequence in a test architecture brings out the possibility of controllability and observability problems. These problems often require the use of external coordination message exchanges among testers. In this paper, we consider constructing a test or checking sequence from the specification of the system under test such that it will be free from these problems and will not require the use of external coordination messages. We give an algorithm that can check whether it is possible to construct subsequences from a given specification that eliminate the need for using external coordination message exchanges, and when it is possible actually produces such subsequences.