One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit

DOI10.1007/978-3-642-00982-2_63zbMath1234.68243OpenAlexW1500871829MaRDI QIDQ3618628

Mathijs de Weerdt, Sicco Verwer, Cees Witteveen

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_63

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Learning One-Clock Timed Automata ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Efficiently identifying deterministic real-time automata from labeled data

Uses Software

• Uppaal

Cites Work

• A theory of timed automata
• Characteristic sets for polynomial grammatical inference
• Uppaal in a nutshell
• Polynomial Distinguishability of Timed Automata
• Complexity of automaton identification from given data
• Language identification in the limit
• Inference of Event-Recording Automata Using Timed Decision Trees

This page was built for publication: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit