Active Automata Learning with Adaptive Distinguishing Sequences

02/04/2019
by   Markus Theo Frohme, et al.
0

This document investigates the integration of adaptive distinguishing sequences into the process of active automata learning (AAL). A novel AAL algorithm "ADT" (adaptive discrimination tree) is developed and presented. Since the submission of the original thesis, the presented algorithm has been integrated into LearnLib - an open-source library for active automata learning - and has been successfully used in related fields of research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/08/2020

Modular Analysis of Tree-Topology Models

We investigate networks of automata that synchronise over common action ...
research
06/20/2022

From Spot 2.0 to Spot 2.10: What's New?

Spot is a C ++ 17 library for LTL and ω-automata manipulation, with comm...
research
08/28/2023

Conflict-Aware Active Automata Learning

Active automata learning algorithms cannot easily handle conflict in the...
research
07/31/2022

Active Learning of One-Clock Timed Automata using Constraint Solving

Active automata learning in the framework of Angluin's L^* algorithm has...
research
07/03/2020

Active learning of timed automata with unobservable resets

Active learning of timed languages is concerned with the inference of ti...
research
02/22/2019

Fast Computations on Ordered Nominal Sets

We show how to compute efficiently with nominal sets over the total orde...
research
06/03/2022

A closer look at TDFA

We present an algorithm for regular expression parsing and submatch extr...

Please sign up or login with your details

Forgot password? Click here to reset