Learning from faults: Mutation testing in active automata learning

13Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

System verification is often hindered by the absence of formal models. Peled et al. proposed black-box checking as a solution to this problem. This technique applies active automata learning to infer models of systems with unknown internal structure. This kind of learning relies on conformance testing to determine whether a learned model actually represents the considered system. Since conformance testing may require the execution of a large number of tests, it is considered the main bottleneck in automata learning. In this paper, we describe a randomised conformance testing approach which we extend with fault-based test selection. To show its effectiveness we apply the approach in learning experiments and compare its performance to a well-established testing technique, the partial W-method. This evaluation demonstrates that our approach significantly reduces the cost of learning–in one experiment by a factor of more than twenty.

Cite

CITATION STYLE

APA

Aichernig, B. K., & Tappler, M. (2017). Learning from faults: Mutation testing in active automata learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10227 LNCS, pp. 19–34). Springer Verlag. https://doi.org/10.1007/978-3-319-57288-8_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free