Projekte pro Jahr
Abstract
Automata learning techniques automatically generate system models from test observations. These techniques usually fall into two categories: passive and active. Passive learning uses a predetermined data set, e.g., system logs. In contrast, active learning actively queries the system under learning, which is considered more efficient.
An influential active learning technique is Angluin’s L∗
algorithm for regular languages which inspired several generalisations from DFAs to other automata-based modelling formalisms. In this work, we study L∗-based learning of deterministic Markov decision processes, first assuming an ideal setting with perfect information. Then, we relax this assumption and present a novel learning algorithm that collects information by sampling system traces via testing. Experiments with the implementation of our sampling-based algorithm suggest that it achieves better accuracy than state-of-the-art passive learning techniques with the same amount of test data. Unlike existing learning algorithms with predefined states, our algorithm learns the complete model structure including the states.
An influential active learning technique is Angluin’s L∗
algorithm for regular languages which inspired several generalisations from DFAs to other automata-based modelling formalisms. In this work, we study L∗-based learning of deterministic Markov decision processes, first assuming an ideal setting with perfect information. Then, we relax this assumption and present a novel learning algorithm that collects information by sampling system traces via testing. Experiments with the implementation of our sampling-based algorithm suggest that it achieves better accuracy than state-of-the-art passive learning techniques with the same amount of test data. Unlike existing learning algorithms with predefined states, our algorithm learns the complete model structure including the states.
Originalsprache | englisch |
---|---|
Titel | Formal Methods - The Next 30 Years |
Redakteure/-innen | Maurice H. ter Beek, Annabelle McIver, José N. Oliveria |
Erscheinungsort | Cham |
Herausgeber (Verlag) | Springer |
Seiten | 651 - 669 |
Seitenumfang | 19 |
ISBN (elektronisch) | 978-3-030-30942-8 |
ISBN (Print) | 978-3-030-30941-1 |
DOIs | |
Publikationsstatus | Veröffentlicht - 2019 |
Veranstaltung | International Symposium on Formal Methods: FM 2019 - Porto, Portugal Dauer: 7 Okt. 2019 → 11 Okt. 2019 |
Publikationsreihe
Name | Lecture Notes in Computer Science |
---|---|
Band | 11800 |
Konferenz
Konferenz | International Symposium on Formal Methods |
---|---|
Kurztitel | FM 2019 |
Land/Gebiet | Portugal |
Ort | Porto |
Zeitraum | 7/10/19 → 11/10/19 |
Fields of Expertise
- Information, Communication & Computing
Fingerprint
Untersuchen Sie die Forschungsthemen von „L*-Based Learning of Markov Decision Processes“. Zusammen bilden sie einen einzigartigen Fingerprint.Projekte
- 1 Abgeschlossen
-
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