Advertisement

On the Complexity of Input Output Conformance Testing

  • Neda NorooziEmail author
  • Mohammad Reza Mousavi
  • Tim A. C. Willemse
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8348)

Abstract

Input-output conformance (ioco) testing is a well-known approach to model-based testing. In this paper, we study the complexity of checking ioco. We show that the problem of checking ioco is PSPACE-complete. To provide a more efficient algorithm, we propose a more restricted setting for checking ioco, namely with deterministic models and show that in this restricted setting ioco checking can be performed in polynomial time.

Notes

Acknowledgments

We thank Sarmen Keshishzadeh and Jeroen Keiren (both TU/e) for feedback on earlier drafts of this paper.

References

  1. 1.
    Aarts, F., Vaandrager, F.: Learning I/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71–85. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  2. 2.
    Abdulla, P.A., Chen, Y.-F., Holík, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158–174. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  3. 3.
    de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of FSE/ESEC’01, pp. 109–120. ACM (2001)Google Scholar
  4. 4.
    Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 163–178. Springer, Heidelberg (1998) CrossRefGoogle Scholar
  5. 5.
    Asaadi, H.R., Khosravi, R., Mousavi, M.R., Noroozi, N.: Towards model-based testing of electronic funds transfer systems. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 253–267. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  6. 6.
    van der Bijl, M., Rensink, A., Tretmans, J.: Compositional testing with ioco. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 86–100. Springer, Heidelberg (2004) CrossRefGoogle Scholar
  7. 7.
    Chatterjee, K., Chaubal, S., Kamath, P.: Faster algorithms for alternating refinement relations. In: Proceedings of the CSL’12. LIPIcs, vol. 16, pp. 167–182. Dagstuhl (2012)Google Scholar
  8. 8.
    Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. JLAP 1(3), 267–284 (1984)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Frantzen, L., Tretmans, J.: Model-based testing of environmental conformance of components. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 1–25. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  10. 10.
    Gregorio-Rodríguez, C., Llana, L., Martínez-Torres, R.: Input-Output Conformance Simulation \((\sf iocos)\) for Model Based Testing. In: Beyer, D., Boreale, M. (eds.) FORTE 2013 and FMOODS 2013. LNCS, vol. 7892, pp. 114–129. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  11. 11.
    Hierons, R.M.: The complexity of asynchronous model based testing. TCS 451, 70–82 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43–68 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Mostowski, W., Poll, E., Schmaltz, J., Tretmans, J., Wichers Schreur, R.: Model-based testing of electronic passports. In: Alpuente, M., Cook, B., Joubert, Ch. (eds.) FMICS 2009. LNCS, vol. 5825, pp. 207–209. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  14. 14.
    Myers, G.J., Badgett, T., Sandler, C.: The Art of Software Testing, 3rd edn. Wiley, New York (2011)Google Scholar
  15. 15.
    Noroozi, N., Mousavi, M.R., Willemse, T.A.C.: Decomposability in input output conformance testing. In: Proceedings of MBT’13. EPTCS, vol. 111, pp. 51–66 (2013)Google Scholar
  16. 16.
    Ploeger, B.: Improved verification methods for concurrent systems. Ph.D. thesis, TU/Eindhoven (2009)Google Scholar
  17. 17.
    Pretschner, A.: One evaluation of model-based testing and its automation. In: Proceedings of ICSE’05, pp. 722–723. ACM (2005)Google Scholar
  18. 18.
    Shukla, S.K., Hunt III, H.B., Rosenkrantz, D.J., Stearns, R.E.: On the complexity of relational problems for finite state processes (extended abstract). In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 466–477. Springer, Heidelberg (1996) CrossRefGoogle Scholar
  19. 19.
    Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: Proceedings STOC’73, pp. 1–9. ACM (1973)Google Scholar
  20. 20.
    Thompson, K.: Regular expression search algorithms. CACM 11(6), 419–422 (1968)CrossRefzbMATHGoogle Scholar
  21. 21.
    Tretmans, J.: Model based testing with labelled transition systems. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST. LNCS, vol. 4949, pp. 1–38. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  22. 22.
    Veanes, M., Bjorner, N.: Alternating simulation and ioco. STTT 14(4), 387–405 (2012)CrossRefGoogle Scholar
  23. 23.
    Veanes, M., Campbell, C., Grieskamp, W., Schulte, W., Tillmann, N., Nachmanson, L.: Model-based testing of object-oriented reactive systems with Spec Explorer. In: Hierons, R.M., Bowen, J.P., Harman, M. (eds.) FORTEST. LNCS, vol. 4949, pp. 39–76. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  24. 24.
    Vishal, V., Kovacioglu, M., Kherazi, R., Mousavi, M.R.: Integrating model-based and constraint-based testing using SpecExplorer. In: Proceedings MoTiP’12, pp. 219–224. IEEE (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Neda Noroozi
    • 1
    Email author
  • Mohammad Reza Mousavi
    • 2
  • Tim A. C. Willemse
    • 1
  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.Center for Research on Embedded SystemsHalmstad UniversityHalmstadSweden

Personalised recommendations