Learning Mealy Machines with One Timer

Frits Vaandrager, Roderick Bloem, Masoud Ebrahimi*

*Korrespondierende/r Autor/-in für diese Arbeit

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandBegutachtung

Abstract

We present Mealy machines with a single timer (MM1Ts), a class of models that is both sufficiently expressive to describe the real-time behavior of many realistic applications, and can be learned efficiently. We show how learning algorithms for MM1Ts can be obtained via a reduction to the problem of learning Mealy machines. We describe an implementation of an MM1T learner on top of LearnLib, and compare its performance with recent algorithms proposed by Aichernig et al. and An et al. on several realistic benchmarks.
Originalspracheenglisch
TitelLanguage and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings
Redakteure/-innenAlberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron
ErscheinungsortCham
Herausgeber (Verlag)Springer Nature Switzerland AG
Seiten157-170
Seitenumfang14
ISBN (Print)9783030681944
DOIs
PublikationsstatusVeröffentlicht - 2021
Veranstaltung14th-15th International Conference on Language and Automata Theory and Applications: LATA 2020&2021 - Mailand, Italien
Dauer: 20 Sep 202124 Sep 2021

Publikationsreihe

NameLecture Notes in Computer Science
Band12638
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349

Konferenz

Konferenz14th-15th International Conference on Language and Automata Theory and Applications
Land/GebietItalien
OrtMailand
Zeitraum20/09/2124/09/21

ASJC Scopus subject areas

  • Theoretische Informatik
  • Informatik (insg.)

Fingerprint

Untersuchen Sie die Forschungsthemen von „Learning Mealy Machines with One Timer“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren