Active Inference of Extended Finite State Machine Models with Registers and Guards
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910160333570048 |
|---|---|
| author | Groz, Roland Baez, German Eduardo Vega Simao, Adenilso Oriat, Catherine Walkinshaw, Neil Foster, Michael |
| author_facet | Groz, Roland Baez, German Eduardo Vega Simao, Adenilso Oriat, Catherine Walkinshaw, Neil Foster, Michael |
| contents | Extended finite state machines (EFSMs) model stateful systems with internal data variables and have numerous applications in software engineering. A major advantage of this type of model lies in its ability to model both the data flow and the data-dependent control behaviour. In the absence of such models, it is desirable to reverse-engineer them by observing the system's behaviour. However, existing approaches generally require the ability to reset the system during inference, or can only handle situations where the control flow depends exclusively on the input parameters, and not on the values of the stored data. In this work, we present a black-box active learning algorithm that infers EFSMs with guards and registers, and which significantly relaxes the assumptions that have to be made about the system in comparison to previous attempts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_21378 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Active Inference of Extended Finite State Machine Models with Registers and Guards Groz, Roland Baez, German Eduardo Vega Simao, Adenilso Oriat, Catherine Walkinshaw, Neil Foster, Michael Formal Languages and Automata Theory Extended finite state machines (EFSMs) model stateful systems with internal data variables and have numerous applications in software engineering. A major advantage of this type of model lies in its ability to model both the data flow and the data-dependent control behaviour. In the absence of such models, it is desirable to reverse-engineer them by observing the system's behaviour. However, existing approaches generally require the ability to reset the system during inference, or can only handle situations where the control flow depends exclusively on the input parameters, and not on the values of the stored data. In this work, we present a black-box active learning algorithm that infers EFSMs with guards and registers, and which significantly relaxes the assumptions that have to be made about the system in comparison to previous attempts. |
| title | Active Inference of Extended Finite State Machine Models with Registers and Guards |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2604.21378 |