Polynomial Distinguishability of Timed Automata

DOI10.1007/978-3-540-88009-7_19MaRDI QIDQ3528423zbMATH OpenOpenAlexFDO

Authors Sicco Verwer, Mathijs M. de Weerdt, Cees Witteveen

Publication date 16 October 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88009-7_19

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• The efficiency of identifying timed automata and the power of clocks
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Polynomial identification of \(\omega \)-automata
• Learning one-clock timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems

Cited in

(5)

• Active learning of timed automata with unobservable resets
• One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
• Efficiently identifying deterministic real-time automata from labeled data
• Polynomial identification of \(\omega \)-automata
• Automata with timers

This page was built for publication: Polynomial Distinguishability of Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528423)