n-Complete Test Suites for IOCO

Petra van den Bos*, Ramon Janssen, Joshua Moerman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review


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.
Original languageEnglish
Title of host publicationTesting Software and Systems
Subtitle of host publication29th IFIP WG 6.1 International Conference, ICTSS 2017, St. Petersburg, Russia, October 9-11, 2017, Proceedings
Number of pages17
ISBN (Print)978-3-319-67548-0
Publication statusPublished - Sept 2017
Externally publishedYes
EventInternational Conference on Testing Software and Systems - St. Petersburg, Russian Federation
Duration: 9 Oct 201711 Oct 2017

Publication series

SeriesLecture Notes in Computer Science


ConferenceInternational Conference on Testing Software and Systems
Abbreviated titleICTSS 2017
Country/TerritoryRussian Federation
CitySt. Petersburg
Internet address


Dive into the research topics of 'n-Complete Test Suites for IOCO'. Together they form a unique fingerprint.

Cite this