Active Learning of Mealy Machines with Timers
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909742083866624 |
|---|---|
| author | Bruyère, Véronique Garhewal, Bharat Pérez, Guillermo A. Staquet, Gaëtan Vaandrager, Frits W. |
| author_facet | Bruyère, Véronique Garhewal, Bharat Pérez, Guillermo A. Staquet, Gaëtan Vaandrager, Frits W. |
| contents | We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a timed setting. We rely on symbolic queries which empower us to reason on untimed executions while learning. Similarly to the algorithm for learning timed automata of Waga, these symbolic queries can be realized using finitely many concrete queries. Experiments with a prototype implementation show that our algorithm is able to efficiently learn realistic benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_02019 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Active Learning of Mealy Machines with Timers Bruyère, Véronique Garhewal, Bharat Pérez, Guillermo A. Staquet, Gaëtan Vaandrager, Frits W. Formal Languages and Automata Theory Machine Learning 68Q45 F.4.3 We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a timed setting. We rely on symbolic queries which empower us to reason on untimed executions while learning. Similarly to the algorithm for learning timed automata of Waga, these symbolic queries can be realized using finitely many concrete queries. Experiments with a prototype implementation show that our algorithm is able to efficiently learn realistic benchmarks. |
| title | Active Learning of Mealy Machines with Timers |
| topic | Formal Languages and Automata Theory Machine Learning 68Q45 F.4.3 |
| url | https://arxiv.org/abs/2403.02019 |