Table of Contents
Fetching ...

Error-awareness Accelerates Active Automata Learning

Loes Kruger, Sebastian Junges, Jurriaan Rot

TL;DR

This work considers various degrees of knowledge about which inputs are non-error producing at which state and provides a matching adaptation of the state-of-the-art AAL algorithm L# to make the most of this domain knowledge.

Abstract

Active automata learning (AAL) algorithms can learn a behavioral model of a system from interacting with it. The primary challenge remains scaling to larger models, in particular in the presence of many possible inputs to the system. Modern AAL algorithms fail to scale even if, in every state, most inputs lead to errors. In various challenging problems from the literature, these errors are observable, i.e., they emit a known error output. Motivated by these problems, we study learning these systems more efficiently. Further, we consider various degrees of knowledge about which inputs are non-error producing at which state. For each level of knowledge, we provide a matching adaptation of the state-of-the-art AAL algorithm L# to make the most of this domain knowledge. Our empirical evaluation demonstrates that the methods accelerate learning by orders of magnitude with strong but realistic domain knowledge to a single order of magnitude with limited domain knowledge.

Error-awareness Accelerates Active Automata Learning

TL;DR

This work considers various degrees of knowledge about which inputs are non-error producing at which state and provides a matching adaptation of the state-of-the-art AAL algorithm L# to make the most of this domain knowledge.

Abstract

Active automata learning (AAL) algorithms can learn a behavioral model of a system from interacting with it. The primary challenge remains scaling to larger models, in particular in the presence of many possible inputs to the system. Modern AAL algorithms fail to scale even if, in every state, most inputs lead to errors. In various challenging problems from the literature, these errors are observable, i.e., they emit a known error output. Motivated by these problems, we study learning these systems more efficiently. Further, we consider various degrees of knowledge about which inputs are non-error producing at which state. For each level of knowledge, we provide a matching adaptation of the state-of-the-art AAL algorithm L# to make the most of this domain knowledge. Our empirical evaluation demonstrates that the methods accelerate learning by orders of magnitude with strong but realistic domain knowledge to a single order of magnitude with limited domain knowledge.
Paper Structure (5 sections, 1 figure, 1 table)

This paper contains 5 sections, 1 figure, 1 table.

Figures (1)

  • Figure 1: Mealy machine, DFA references and an observation tree related to a toy TLS system. Double circle states represent final states. Omitted DFA transitions lead to the (non-final) sink state. The $+$-symbol on transitions represents all inputs for which a transition is not explicitly drawn.

Theorems & Definitions (5)

  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • definition thmcounterdefinition