Testing Membership for Timed Automata

Richard Lassaigne, Michel de Rougemont

Given a timed automata which admits thick components and a timed word $x$, we present a tester which decides if $x$ is in the language of the automaton or if $x$ is $\epsilon$-far from th…