Active Learning of Decomposable Systems

Active automata learning is a technique of querying black box systems and modelling their behaviour. In this paper, we aim to apply active learning in parts. We formalise the conditions on systems—with a decomposable set of actions—that make learning in parts possible. The systems are themselves decomposable through nonintersecting subsets of actions. Learning these subsystems/components requires less time and resources. We prove that the technique works for both two components as well as an arbitrary number of components. We illustrate the usefulness of this technique through a classical example and through a real example from the industry.CCS CONCEPTS• Computing methodologies $\rightarrow$Model development and analysis;• Theory of computation $\rightarrow$Formal languages and automata theory; Active learning;• Software and its engineering $\rightarrow$ Model-driven software engineering.