Active learning of timed automata with unobservable resets
From MaRDI portal
Publication:1996023
DOI10.1007/978-3-030-57628-8_9OpenAlexW3041783001MaRDI QIDQ1996023
Thierry Jéron, Nicolas Markey, Léo Henry
Publication date: 2 March 2021
Full work available at URL: https://arxiv.org/abs/2007.01637
Related Items (5)
Learning deterministic one-clock timed automata via mutation testing ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Learning Mealy machines with one timer ⋮ Active learning of timed automata with unobservable resets ⋮ Learning Mealy machines with one timer
Cites Work
- Efficiently identifying deterministic real-time automata from labeled data
- Network invariants for real-time systems
- Learning regular sets from queries and counterexamples
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- Active learning of timed automata with unobservable resets
- Time to learn -- learning timed automata from tests
- Queries and concept learning
- A Game Approach to Determinize Timed Automata
- Polynomial Distinguishability of Timed Automata
- Learning One-Clock Timed Automata
- Inference of Event-Recording Automata Using Timed Decision Trees
This page was built for publication: Active learning of timed automata with unobservable resets
