2020
DOI: 10.1007/978-3-030-64881-7_4
|View full text |Cite
|
Sign up to set email alerts
|

Learning Abstracted Non-deterministic Finite State Machines

Abstract: Active automata learning gains increasing interest since it gives an insight into the behavior of a black-box system. A crucial drawback of the frequently used learning algorithms based on Angluin's L * is that they become impractical if systems with a large input/output alphabet are learned. Previous work suggested to circumvent this problem by abstracting the input alphabet and the observed outputs. However, abstraction could introduce non-deterministic behavior. Already existing active automata learning alg… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3

Relationship

4
3

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…AALpy replaces this assumption with a more practical implementation using sampling. Recently, Pferscher and Aichernig [27] proposed an extension of the classic ONFSM learning algorithm. Their extension learns abstracted ONFSMs by introducing equivalence classes for outputs.…”
Section: Aalpy Provides Two Algorithms For Learning Observable Non-de...mentioning
confidence: 99%
“…AALpy replaces this assumption with a more practical implementation using sampling. Recently, Pferscher and Aichernig [27] proposed an extension of the classic ONFSM learning algorithm. Their extension learns abstracted ONFSMs by introducing equivalence classes for outputs.…”
Section: Aalpy Provides Two Algorithms For Learning Observable Non-de...mentioning
confidence: 99%
“…The broker publishes the will of a client when the client disconnects. In the literature, we find several case studies [36,1,27] which applied active automata learning to learn behavioral models of different MQTT-broker implementations. The learned behavioral models revealed inconsistencies in the MQTT specification.…”
Section: Message Queuing Telemetry Transportmentioning
confidence: 99%
“…Instead of workarounds to overcome nondeterministic behavior, we could learn a non-deterministic model. We already applied non-deterministic learning to the MQTT protocol [28]. Following a similar idea, we could learn a non-deterministic model of the BLE protocol.…”
Section: Future Workmentioning
confidence: 99%