Testing Membership for Timed Automata

12/17/2019

∙

by   Richard Lassaigne, et al.

∙

0

∙

share

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 ϵ-far from the language, using finitely many samples taken from the weighted time distribution μ associated with an input x. We introduce a distance between timed words, the timed edit distance, which generalizes the classical edit distance. A timed word x is ϵ-far from a timed language if its relative distance to the language is greater than ϵ.