Abstract
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.
Cite
CITATION STYLE
van den Bos, P., Janssen, R., & Moerman, J. (2017). n-Complete test suites for IOCO. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10533 LNCS, pp. 91–107). Springer Verlag. https://doi.org/10.1007/978-3-319-67549-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
