%0 Conference Proceedings
%T n-Complete Test Suites for IOCO
%+ Radboud University [Nijmegen]
%A Bos, Petra, van Den
%A Janssen, Ramon
%A Moerman, Joshua
%Z Part 2: Test Derivation Methods
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 29th IFIP International Conference on Testing Software and Systems (ICTSS)
%C St. Petersburg, Russia
%Y Nina Yevtushenko
%Y Ana Rosa Cavalli
%Y Hüsnü Yenigün
%I Springer International Publishing
%3 Testing Software and Systems
%V LNCS-10533
%P 91-107
%8 2017-10-09
%D 2017
%R 10.1007/978-3-319-67549-7_6
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. This principle is well-known when testing FSMs for equivalence, but the problem becomes harder for ioco conformance on labeled transitions systems. Existing methods restrict the structure of specifications and implementations. We eliminate those restrictions, using only the number of implementation states, and fairness in test execution. We provide a formalization, a construction and a correctness proof for n-complete test suites for ioco.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01678988/document
%2 https://inria.hal.science/hal-01678988/file/449632_1_En_6_Chapter.pdf
%L hal-01678988
%U https://inria.hal.science/hal-01678988
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-10533