Active learning of deterministic timed automata with Myhill-Nerode style characterization

DOI10.1007/978-3-031-37706-8_1MaRDI QIDQ6535622zbMATH OpenFDO

Authors Masaki Waga

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

timed automataactive automata learningobservation tableL* algorithmrecognizable timed languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Recommendations

• Active learning of one-clock timed automata using constraint solving
• Learning one-clock timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• An efficient algorithm for learning event-recording automata
• Learning of event-recording automata

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 1863168 (Why is no real title available?)
• scientific article; zbMATH DE number 1418458 (Why is no real title available?)
• A Machine-Independent Characterization of Timed Languages
• A logical characterization of timed regular languages
• A theory of timed automata
• Active learning of deterministic timed automata with Myhill-Nerode style characterization
• Active learning of one-clock timed automata using constraint solving
• Active learning of timed automata with unobservable resets
• Falsification of cyber-physical systems with robustness-guided black-box checking
• Foundations of Software Science and Computation Structures
• Inference of Event-Recording Automata Using Timed Decision Trees
• Inference of finite automata using homing sequences
• Learning of event-recording automata
• Learning one-clock timed automata
• Learning regular sets from queries and counterexamples
• Learning symbolic automata
• The learnability of symbolic automata
• Time to learn -- learning timed automata from tests
• Timed regular expressions

Cited in

(1)

• Active learning of deterministic timed automata with Myhill-Nerode style characterization

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)