Learning One-Clock Timed Automata
From MaRDI portal
Publication:5039523
DOI10.1007/978-3-030-45190-5_25MaRDI QIDQ5039523
Jie An, Mingshuai Chen, Bohua Zhan, Miaomiao Zhang, Naijun Zhan
Publication date: 13 October 2022
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10680
active learning; automaton learning; timed language; one-clock timed automata; reset-logical-timed language
Related Items
Compositional learning for interleaving parallel automata, Equivalence checking and intersection of deterministic timed finite state machines, Learning deterministic one-clock timed automata via mutation testing, Active learning of one-clock timed automata using constraint solving, Active learning of timed automata with unobservable resets, Inferring switched nonlinear dynamical systems, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Learning Mealy machines with one timer
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficiently identifying deterministic real-time automata from labeled data
- The efficiency of identifying timed automata and the power of clocks
- Learning of event-recording automata
- Active learning for extended finite state machines
- Learning regular sets from queries and counterexamples
- Event-clock automata: a determinizable class of timed automata
- A theory of timed automata
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- Combining black-box and white-box techniques for learning register automata
- Time to learn -- learning timed automata from tests
- Learning Register Automata with Fresh Value Generation
- Inferring Canonical Register Automata
- Learning Regular Languages over Large Ordered Alphabets
- Learning Symbolic Automata
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
- Learning I/O Automata
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Formal Methods for the Design of Real-Time Systems
- The learnability of symbolic automata
