In this paper we use equation solving for translating internal tests derived for a component embedded within a composite system into external tests defined over the external alphabets of the system. The composite system is represented as two communicating finite state machines (FSMs), an embedded component FSM, and a context FSM that models the remaining part of the system and which is assumed to be correctly implemented. Application example is given to demonstrate the steps of the method. The method can be adapted for test derivation for a system of two or more communicating FSMs.


Test Suite Finite State Machine Large Solution External Test Internal Test 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Barrett, G., Lafortune, S.: Bisimulation, the supervisory control problem, and strong model matching for finite ftate machines. Discrete Event Dynamic Systems: Theory and Application 8(4), 377–429 (1998)CrossRefzbMATHGoogle Scholar
  2. 2.
    von Bochmann, G., Merlin, P.M.: On the construction of communication protocols. In: ICCC, pp. 371–378 (1980); Sunshine, C. (ed.): Reprinted in Communication Protocol Modeling. Artech House Publ., Norwood (1981)Google Scholar
  3. 3.
    Buffalov, S., El-Fakih, K., Yevtushenko, N., von Bochmann, G.: Progressive solutions to a parallel automata equation. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 367–382. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Cavalli, D., Lee, D., Rinderknecht, C., Zaidi, F.: Hit-or-Jump: An algorithm for embedded testing with applications to IN services. In: Proceedings of Joint Inter. Conf. FORTE/PSTV99, pp. 41–58 (1999)Google Scholar
  5. 5.
    Chow, T.S.: Test design modeled by finite-state machines. IEEE Trans. SE 4(3), 178–187 (1978)CrossRefzbMATHGoogle Scholar
  6. 6.
    Drissi, J., von Bochmann, G.: Submodule Construction for systems of I/O Automata. Technical Report #1133, DIRO, Universite’ de Montreal, Canada (1999)Google Scholar
  7. 7.
    El-Fakih, K., Trenkaev, V., Spitsyna, N., Yevtushenko, N.: FSM Based Interoperability Testing Methods. In: Groz, R., Hierons, R.M. (eds.) TestCom 2004. LNCS, vol. 2978, pp. 60–75. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  8. 8.
    El-Fakih, K., Prokopenko, S., Yevtushenko, N., von Bochmann, G.: Fault diagnosis in extended finite state machines. In: Hogrefe, D., Wiles, A. (eds.) TestCom 2003. LNCS, vol. 2644, pp. 197–210. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, New York (1979)zbMATHGoogle Scholar
  10. 10.
    Kelekar, S.G.H.: Synthesis of protocols and protocol converters using the submodule construction approach. In: Danthine, A., et al. (eds.) Protocol Specification, Testing, and Verification-PSTV XIII (1994)Google Scholar
  11. 11.
    Hierons, R., Ural, H.: Concerning the ordering of adaptive test sequences. In: König, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 289–302. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Information technology. Open systems interaction. Conformance testing methodology and framework. International standard IS-9646 (1991)Google Scholar
  13. 13.
    Kumar, R., Nelvagal, S., Marcus, S.I.: A discrete event systems approach for protocol conversion. Discrete Event Dynamical Systems: Theory and Applications 7(3), 295–315 (1997)CrossRefzbMATHGoogle Scholar
  14. 14.
    Lima, L.P., Cavalli, A.R.: A pragmatic approach to generating test sequences for embedded systems. In: Proceedings of 10th IWTCS, pp. 125–140 (1997)Google Scholar
  15. 15.
    Lee, D., Sabnani, K., Kristol, D.M., Paul, S.: Conformance testing of protocols specified as communicating finite state machines - a guided random walk based approach. IEEE Transactions on Communications 44(5), 631–640 (1996)CrossRefGoogle Scholar
  16. 16.
    Merlin, P., von Bochman, G.: On the construction of submodule specifications and communication protocols. ACM Trans. On Programming Languages and Systems 5(1), 1–25 (1983)CrossRefzbMATHGoogle Scholar
  17. 17.
    Parrow, J.: Submodule construction as equation solving in CCS. Theoretical Computer Science 68 (1989)Google Scholar
  18. 18.
    Petrenko, Yevtushenko, N., von Bochmann, G.: Fault models for testing in context. In: FORTE 1996 (1996)Google Scholar
  19. 19.
    Petrenko, Yevtushenko, N., von Bochmann, G.: Testing deterministic implementations from their nondeterministic specifications. In: Proceedings of the IFIP 9th International Workshop on Testing of Communicating Systems, Germany, pp. 125–140 (1996)Google Scholar
  20. 20.
    Petrenko, Yevtushenko, N., von Bochmann, G., Dssouli, R.: Testing in context: framework and test derivation. Computer communications 19, 1236–1249 (1996)CrossRefGoogle Scholar
  21. 21.
    Petrenko, Yevtushenko, N.: Solving asynchronous equations. In: Bukowski, S., Cavalli, A., Najm, E. (eds.) Formal Description Techniques and Protocol Specification, Testing, and Verification-FORTE XI/PSTVXVIII 1998, pp. 231–247. Chapman-Hall, Boca Raton (1998)CrossRefGoogle Scholar
  22. 22.
    Petrenko, Yevtushenko, N., Lebedev, A., Das, A.: Nondeterministic State Machines in Protocol Conformance Testing. In: Proc. of the IFIP 6th IWPTS, France, pp. 363–378 (1993)Google Scholar
  23. 23.
    Qin, H., Lewis, P.: Factorisation of finite state machines under strong and observational equivalences. Journal of Formal Aspects of Computing 3, 284–307 (1991)CrossRefzbMATHGoogle Scholar
  24. 24.
    Tao, Z., von Bochmann, G., Dssouli, R.: A formal method for synthesizing optimized protocol converters and its application to mobile data networks. Mobile Networks & Applications 2(3), 259–269 (1997)CrossRefGoogle Scholar
  25. 25.
    Yevtushenko, N., Cavalli, A.R., Lima, L.P.: Test minimization for testing in context. In: Proceedings of the 11th IWTCS, pp. 127–145 (1998)Google Scholar
  26. 26.
    Yevtushenko, N., Villa, T., Brayton, R.K., Petrenko, A., Sangiovanni-Vincentelli, A.: Solution of parallel language equations for logic synthesis. In: Proc. of the International Conference on Computer-Aided Design, pp. 103–110 (2001)Google Scholar
  27. 27.
    Wonham, W.M., Ramadge, P.J.: On the supremal controllable sublanguage of a given language. SIAM J. Control. Optimization 25(3), 637–659 (1987)MathSciNetCrossRefGoogle Scholar
  28. 28.
    El-Fakih, K., Yevtushenko, N., von Bochmann, G.: Diagnosing multiple faults in communicating finite state machines. In: Proc. of the IFIP 21st International Conference on Formal Techniques for Networked and Distributed Systems (FORTE 2001), Cheju Island, Korea, pp. 85–100 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2004

Authors and Affiliations

  • Khaled El-Fakih
    • 1
  • Nina Yevtushenko
    • 2
  1. 1.American University of SharjahSharjahUAE
  2. 2.Tomsk State UniversityTomskRussia

Personalised recommendations