activity
20222025
most citedActive vs. Passive: A Comparison of Automata Learning Paradigms for Network Protocols

15 citations · 15 across the 3 of their papers we have counts for

collaborators

5 papers

cs.FL2025

Passive Model Learning of Visibly Deterministic Context-free Grammars

Edi Muškardin, Tamim Burgstaller

We present PAPNI, a passive automata learning algorithm capable of learning deterministic context-free grammars, which are modeled with visibly deterministic pushdown automata. PAP…

cs.LG2023

Learning Environment Models with Continuous Stochastic Dynamics

Martin Tappler, Edi Muškardin, Bernhard K. Aichernig +1

Solving control tasks in complex environments automatically through learning offers great potential. While contemporary techniques from deep reinforcement learning (DRL) provide ef…

cs.LG2023

On the Relationship Between RNN Hidden State Vectors and Semantic Ground Truth

Edi Muškardin, Martin Tappler, Ingo Pill +2

We examine the assumption that the hidden-state vectors of recurrent neural networks (RNNs) tend to form clusters of semantically similar vectors, which we dub the clustering hypot…

cs.LG2022

Automata Learning meets Shielding

Martin Tappler, Stefan Pranger, Bettina Könighofer +3

Safety is still one of the major research challenges in reinforcement learning (RL). In this paper, we address the problem of how to avoid safety violations of RL agents during exp…

cs.FL202215 cited

Active vs. Passive: A Comparison of Automata Learning Paradigms for Network Protocols

Bernhard K. Aichernig, Edi Muškardin, Andrea Pferscher

Active automata learning became a popular tool for the behavioral analysis of communication protocols. The main advantage is that no manual modeling effort is required since a beha…