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.
Chapter PDF
Similar content being viewed by others
References
Boyd, S., Ural, H.: The synchronization problem in protocol testing and its complexity. Information Processing Letters 40, 131–136 (1991)
Cacciari, L., Rafiq, O.: Controllability and observability in distributed testing. Information and Software Technology 41, 767–780 (1999)
Chen, J., Hierons, R.M., Ural, H.: Overcoming observability problems in distributed test architectures. Submitted for publication
Chen, J., Hierons, R.M., Ural, H.: Conditions for resolving observability problems in distributed testing. In: de Frutos-Escrig, D., Núñez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 229–242. Springer, Heidelberg (2004)
Chen, W., Ural, H.: Synchronizable checking sequences based on multiple UIO sequences. IEEE/ACM Transactions on Networking 3, 152–157 (1995)
Gill, A.: Introduction to the Theory of Finite-State Machines. McGraw- Hill, New York (1962)
Guyot, S., Ural, H.: Synchronizable checking sequences based on UIO sequences. In: Proc. of IFIP IWPTS 1995, Evry, France, pp. 395–407 (September 1995)
Hennie, F.C.: Fault detecting experiments for sequential circuits. In: Proc. of Fifth Ann. Symp. Switching Circuit Theory and Logical Design, Princeton, N.J, pp. 95–110 (1964)
Hierons, R.M.: Testing a distributed system: generating minimal synchronised test sequences that detect output-shifting faults. Information and Software Technology 43(9), 551–560 (2001)
Lee, D., Yannakakis, M.: Principles and methods of testing finitestate machines a survey. Proceedings of the IEEE 84(8), 1089–1123 (1996)
Luo, G., Dssouli, R., Bochmann, G.v.: Generating synchronizable test sequences based on finite state machine with distributed ports. In: The 6th IFIP Workshop on Protocol Test Systems, pp. 139–153. Elsevier, North-Holland (1993)
Luo, G., Dssouli, R., Bochmann, G.v., Venkataram, P., Ghedamsi, A.: Test generation with respect to distributed interfaces. Computer Standards and Interfaces 16, 119–132 (1994)
Sabnani, K.K., Dahbura, A.T.: A protocol test generation procedure. Computer Networks 15, 285–297 (1988)
Sarikaya, B., Bochmann, G.v.: Synchronization and specification issues in protocol testing. IEEE Transactions on Communications 32, 389–395 (1984)
Tai, K.C., Young, Y.C.: Synchronizable test sequences of finite state machines. Computer Networks 13, 1111–1134 (1998)
Ural, H., Wang, Z.: Synchronizable test sequence generation using UIO sequences. Computer Communications 16, 653–661 (1993)
Young, Y.C., Tai, K.C.: Observation inaccuracy in conformance testing with multiple testers. In: Proc. of IEEE WASET, pp. 80–85 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chen, J., Hierons, R.M., Ural, H. (2005). Resolving Observability Problems in Distributed Test Architectures. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_17
Download citation
DOI: https://doi.org/10.1007/11562436_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)