Active learning of deterministic timed automata with Myhill-Nerode style characterization
From MaRDI portal
Publication:6535622
DOI10.1007/978-3-031-37706-8_1zbMATH Open1547.68287MaRDI QIDQ6535622FDOQ6535622
Authors: Masaki Waga
Publication date: 1 February 2024
Recommendations
Cites Work
- A theory of timed automata
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Timed regular expressions
- Inference of finite automata using homing sequences
- Inference of Event-Recording Automata Using Timed Decision Trees
- Learning of event-recording automata
- Foundations of Software Science and Computation Structures
- A logical characterization of timed regular languages
- Title not available (Why is that?)
- Learning symbolic automata
- Active learning of timed automata with unobservable resets
- Time to learn -- learning timed automata from tests
- Learning one-clock timed automata
- A Machine-Independent Characterization of Timed Languages
- The learnability of symbolic automata
- Falsification of cyber-physical systems with robustness-guided black-box checking
- Active learning of one-clock timed automata using constraint solving
- Active learning of deterministic timed automata with Myhill-Nerode style characterization
Cited In (1)
This page was built for publication: Active learning of deterministic timed automata with Myhill-Nerode style characterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535622)