This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Controllable Testing from Nondeterministic Finite State Machines with Multiple Ports
December 2011 (vol. 60 no. 12)
pp. 1818-1822
Robert M. Hierons, Brunel University
Some systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are using the distributed test architecture. It is known that this test architecture introduces controllability problems when testing from a deterministic finite state machine. This paper investigates the problem of testing from a nondeterministic finite state machine in the distributed test architecture and explores controllability. It shows how we can decide in polynomial time whether an input sequence is controllable. It also gives an algorithm for generating such an input sequence \bar{x} and shows how we can produce testers that implement \bar{x}.

[1] A.Y. Duale and M.U. Uyar, “A Method Enabling Feasible Conformance Test Sequence Generation for EFSM Models,” IEEE Trans. Computers, vol. 53, no. 5, pp. 614-627, May 2004.
[2] W. Grieskamp, “Multi-Paradigmatic Model-Based Testing,” Formal Approaches to Software Testing and Runtime Verification (FATES/RV '06), pp. 1-19, Springer, 2006.
[3] D. Lee and M. Yannakakis, “Principles and Methods of Testing Finite-State Machines—A Survey,” Proc. IEEE, vol. 84, no. 8, pp. 1090-1123, Aug. 1996.
[4] J. Chen, R.M. Hierons, and H. Ural, “Overcoming Observability Problems in Distributed Test Architectures,” Information Processing Letters, vol. 98, pp. 177-182, 2006.
[5] R. Dssouli and G. von Bochmann, “Error Detection with Multiple Observers,” Protocol Specification, Testing and Verification V, pp. 483-494, Elsevier Science, 1985.
[6] R.M. Hierons and H. Ural, “Synchronized Checking Sequences Based on UIO Sequences,” Information and Software Technology, vol. 45, no. 12, pp. 793-803, 2003.
[7] O. Rafiq and L. Cacciari, “Coordination Algorithm for Distributed Testing,” J. Supercomputing, vol. 24, no. 2, pp. 203-211, 2003.
[8] H. Ural and C. Williams, “Constructing Checking Sequences for Distributed Testing,” Formal Aspects of Computing, vol. 18, no. 1, pp. 84-101, 2006.
[9] Y.C. Young and K.C. Tai, “Observational Inaccuracy in Conformance Testing with Multiple Testers,” Proc. IEEE First Workshop Application-Specific Software Eng. and Technology, pp. 80-85, 1998.
[10] R.M. Hierons and H. Ural, “The Effect of the Distributed Test Architecture on the Power of Testing,” The Computer J., vol. 51, no. 4, pp. 497-510, 2008.
[11] J.L. Jacob, “Refinement of Shared Systems,” The Theory and Practice of Refinement: Approaches to the Formal Development of Large-Scale Software Systems, J. McDermid, ed., pp. 27-36, Butterworths, 1989.
[12] M.A. Fecko, M.U. Uyar, A.S. Sethi, and P.D. Amer, “Conformance Testing in Systems with Semicontrollable Interfaces,” Annals of Telecomm., vol. 55, no. 2, pp. 70-83, 2000.
[13] R.M. Hierons, M.G. Merayo, and M. Núnez, “Controllable Test Cases for the Distributed Test Architecture,” Proc. Sixth Int'l Symp. Automated Technology for Verification and Analysis (ATVA '08), pp. 201-215, 2008.
[14] J.T.C. ISO/IEC JTC 1, Int'l Standard ISO/IEC 9646-1. Information Technology—Open Systems Interconnection—Conformance Testing Methodology and Framework—Part 1: General Concepts. ISO/IEC, 1994.
[15] R.M. Hierons, M.G. Merayo, and M. Núnez, “Implementation Relations for The Distributed Test Architecture,” Testing of Software and Communicating Systems (TestCom/FATES '08), pp. 200-215, Springer, 2008.
[16] M. Holzer and M. Kutrib, “State Complexity of Basic Operations on Nondeterministic Finite Automata,” Proc. Seventh Int'l Conf. Implementation and Application of Automata (CIAA), pp. 148-157, 2002.
[17] A. Petrenko and N. Yevtushenko, “Testing from Partial Deterministic FSM Specifications,” IEEE Trans. Computers, vol. 54, no. 9, pp. 1154-1165, 2005.
[18] R. Alur, C. Courcoubetis, and M. Yannakakis, “Distinguishing Tests for Nondeterministic and Probabilistic Machines,” Proc. 27th ACM Symp. Theory of Computing, pp. 363-372, 1995.
[19] S. Haar, C. Jard, and G.-V. Jourdan, “Testing Input/Output Partial Order Automata,” Testing Input/Output Partial Order Automata, in (TestCom/FATES '07), pp. 171-185, Springer, 2007.

Index Terms:
Software engineering/software/program verification, software engineering/testing and debugging, finite state machine, nondeterminism, controllability, distributed test architecture.
Citation:
Robert M. Hierons, "Controllable Testing from Nondeterministic Finite State Machines with Multiple Ports," IEEE Transactions on Computers, vol. 60, no. 12, pp. 1818-1822, Dec. 2011, doi:10.1109/TC.2010.238
Usage of this product signifies your acceptance of the Terms of Use.