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

Sicco Verwer Mathijs de Weerdt Cees Witteveen

Published in: LATA (2009)

Keyphrases

timed automata
model checking
high speed
reachability analysis
machine learning
black box
theorem prover
databases
relational databases