Learning Mealy Machines with One Timer

Frits Vaandrager; Roderick Bloem; Masoud Ebrahimi

doi:10.1007/978-3-030-68195-1_13

Learning Mealy Machines with One Timer

Frits Vaandrager, Roderick Bloem, Masoud Ebrahimi^*

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

Institut für Angewandte Informationsverarbeitung und Kommunikationstechnologie (7050)

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

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.

Originalsprache	englisch
Titel	Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings
Redakteure/-innen	Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron
Erscheinungsort	Cham
Herausgeber (Verlag)	Springer Nature Switzerland AG
Seiten	157-170
Seitenumfang	14
ISBN (Print)	9783030681944
DOIs	https://doi.org/10.1007/978-3-030-68195-1_13
Publikationsstatus	Veröffentlicht - 2021
Veranstaltung	14th-15th International Conference on Language and Automata Theory and Applications: LATA 2020&2021 - Mailand, Italien Dauer: 20 Sept. 2021 → 24 Sept. 2021

Publikationsreihe

Name	Lecture Notes in Computer Science
Band	12638
ISSN (Print)	0302-9743
ISSN (elektronisch)	1611-3349

Konferenz

Konferenz	14th-15th International Conference on Language and Automata Theory and Applications
Land/Gebiet	Italien
Ort	Mailand
Zeitraum	20/09/21 → 24/09/21

ASJC Scopus subject areas

Theoretische Informatik
Allgemeine Computerwissenschaft

Zugriff auf Dokument

10.1007/978-3-030-68195-1_13

Andere Dateien und Links

http://www.scopus.com/inward/record.url?scp=85104377380&partnerID=8YFLogxK

TRUSTED - VerTRaUen, Sicherheit & AuTonomie im FahrzEug Der Zukunft
Bloem, R.
1/11/19 → 31/10/22
Projekt: Forschungsprojekt
Verlaesslichkeit im Internet der Dinge
Boano, C. A., Kubin, G., Bloem, R., Horn, M., Pernkopf, F., Zakany, N., Mangard, S., Witrisal, K., Römer, K. U., Aichernig, B., Bösch, W., Baunach, M. C., Tappler, M., Malenko, M., Weiser, S., Eichlseder, M., Leitinger, E., Grosinger, J., Großwindhager, B., Ebrahimi, M., Alothman Alterkawi, A. B., Knoll, C., Teschl, R., Saukh, O., Rath, M., Steinberger, M., Steinbauer-Wagner, G. & Tranninger, M.
1/01/16 → 31/03/22
Projekt: Forschungsprojekt

Dieses zitieren

Vaandrager, F., Bloem, R., & Ebrahimi, M. (2021). Learning Mealy Machines with One Timer. in A. Leporati, C. Martín-Vide, D. Shapira, & C. Zandron (Hrsg.), Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings (S. 157-170). (Lecture Notes in Computer Science; Band 12638). Springer Nature Switzerland AG. https://doi.org/10.1007/978-3-030-68195-1_13

Learning Mealy Machines with One Timer. / Vaandrager, Frits; Bloem, Roderick; Ebrahimi, Masoud.
Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings. Hrsg. / Alberto Leporati; Carlos Martín-Vide; Dana Shapira; Claudio Zandron. Cham: Springer Nature Switzerland AG, 2021. S. 157-170 (Lecture Notes in Computer Science; Band 12638).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Vaandrager, F, Bloem, R & Ebrahimi, M 2021, Learning Mealy Machines with One Timer. in A Leporati, C Martín-Vide, D Shapira & C Zandron (Hrsg.), Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings. Lecture Notes in Computer Science, Bd. 12638, Springer Nature Switzerland AG, Cham, S. 157-170, 14th-15th International Conference on Language and Automata Theory and Applications, Mailand, Italien, 20/09/21. https://doi.org/10.1007/978-3-030-68195-1_13

Vaandrager, Frits ; Bloem, Roderick ; Ebrahimi, Masoud. / Learning Mealy Machines with One Timer. Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings. Hrsg. / Alberto Leporati ; Carlos Martín-Vide ; Dana Shapira ; Claudio Zandron. Cham : Springer Nature Switzerland AG, 2021. S. 157-170 (Lecture Notes in Computer Science).

@inproceedings{3284b23d591341db9c2daeb6a0a00329,

title = "Learning Mealy Machines with One Timer",

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.",

keywords = "Automata learning, Mealy Machines, Timed automata, WiFi, WPA2",

author = "Frits Vaandrager and Roderick Bloem and Masoud Ebrahimi",

year = "2021",

doi = "10.1007/978-3-030-68195-1_13",

language = "English",

isbn = "9783030681944",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland AG",

pages = "157--170",

editor = "Alberto Leporati and Carlos Mart{\'i}n-Vide and Dana Shapira and Claudio Zandron",

booktitle = "Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings",

address = "Switzerland",

note = "14th-15th International Conference on Language and Automata Theory and Applications : LATA 2020&2021 ; Conference date: 20-09-2021 Through 24-09-2021",

}

TY - GEN

T1 - Learning Mealy Machines with One Timer

AU - Vaandrager, Frits

AU - Bloem, Roderick

AU - Ebrahimi, Masoud

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Automata learning

KW - Mealy Machines

KW - Timed automata

KW - WiFi

KW - WPA2

UR - http://www.scopus.com/inward/record.url?scp=85104377380&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-68195-1_13

DO - 10.1007/978-3-030-68195-1_13

M3 - Conference paper

SN - 9783030681944

T3 - Lecture Notes in Computer Science

SP - 157

EP - 170

BT - Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings

A2 - Leporati, Alberto

A2 - Martín-Vide, Carlos

A2 - Shapira, Dana

A2 - Zandron, Claudio

PB - Springer Nature Switzerland AG

CY - Cham

T2 - 14th-15th International Conference on Language and Automata Theory and Applications

Y2 - 20 September 2021 through 24 September 2021

ER -

Learning Mealy Machines with One Timer

Abstract

Publikationsreihe

Konferenz

ASJC Scopus subject areas

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Projekte

TRUSTED - VerTRaUen, Sicherheit & AuTonomie im FahrzEug Der Zukunft

Verlaesslichkeit im Internet der Dinge

Dieses zitieren