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)
On Minimizing the Lengths of Checking Sequences
IEEE Transactions on Computers
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
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 observability problems in distributed test architectures
Information Processing Letters
Conditions for avoiding controllability problems in distributed testing
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
| Hi-index | 0.00 |
Application of a test or checking sequence in a distributed test architecture often requires the use of external coordination message exchanges among multiple remote testers for eluding potential controllability and observability problems. Recent literature reports on conditions on a given finite state machine (FSM) under which controllability and observability problems can be overcome without using external coordination messages. However, these conditions do not guarantee that any test/checking sequence constructed from such FSMs are free from controllability and observability problems. For a given test or checking sequence, this paper investigates whether it is possible to eliminate the need for external coordination messages and proposes algorithms to identify or construct subsequences either within the given sequence or as an extension to the given sequence, respectively.