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^*

^*Corresponding author for this work

Institute of Applied Information Processing and Communications (7050)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

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.

Original language	English
Title of host publication	Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings
Editors	Alberto Leporati, Carlos Martín-Vide, Dana Shapira, Claudio Zandron
Place of Publication	Cham
Publisher	Springer Nature Switzerland AG
Pages	157-170
Number of pages	14
ISBN (Print)	9783030681944
DOIs	https://doi.org/10.1007/978-3-030-68195-1_13
Publication status	Published - 2021
Event	14th-15th International Conference on Language and Automata Theory and Applications: LATA 2020&2021 - Mailand, Italy Duration: 20 Sept 2021 → 24 Sept 2021

Publication series

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

Conference

Conference	14th-15th International Conference on Language and Automata Theory and Applications
Country/Territory	Italy
City	Mailand
Period	20/09/21 → 24/09/21

Keywords

Automata learning
Mealy Machines
Timed automata
WiFi
WPA2

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Vaandrager, F., Bloem, R., & Ebrahimi, M. (2021). Learning Mealy Machines with One Timer. In A. Leporati, C. Martín-Vide, D. Shapira, & C. Zandron (Eds.), Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings (pp. 157-170). (Lecture Notes in Computer Science; Vol. 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. ed. / Alberto Leporati; Carlos Martín-Vide; Dana Shapira; Claudio Zandron. Cham: Springer Nature Switzerland AG, 2021. p. 157-170 (Lecture Notes in Computer Science; Vol. 12638).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Vaandrager, F, Bloem, R & Ebrahimi, M 2021, Learning Mealy Machines with One Timer. in A Leporati, C Martín-Vide, D Shapira & C Zandron (eds), Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings. Lecture Notes in Computer Science, vol. 12638, Springer Nature Switzerland AG, Cham, pp. 157-170, 14th-15th International Conference on Language and Automata Theory and Applications, Mailand, Italy, 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. editor / Alberto Leporati ; Carlos Martín-Vide ; Dana Shapira ; Claudio Zandron. Cham : Springer Nature Switzerland AG, 2021. pp. 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

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

TRUSTED - Trutst, security & autonomy in automation of the future

Dependable Internet of Things

Cite this

Learning Mealy Machines with One Timer

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Projects

TRUSTED - Trutst, security & autonomy in automation of the future

Dependable Internet of Things

Cite this