Testing Membership for Timed Automata
Richard Lassaigne, Michel de Rougemont

TL;DR
This paper introduces a testing method for timed automata that determines if a timed word belongs to the automaton's language or is far from it, using a new timed edit distance and finite sampling.
Contribution
It presents a novel tester for timed automata that leverages a new timed edit distance and finite sampling to decide membership or epsilon-far status.
Findings
Introduces a tester for timed automata membership.
Defines a new timed edit distance metric.
Provides a decision procedure using finite samples.
Abstract
Given a timed automata which admits thick components and a timed word , we present a tester which decides if is in the language of the automaton or if is -far from the language, using finitely many samples taken from the weighted time distribution associated with an input . We introduce a distance between timed words, the {\em timed edit distance}, which generalizes the classical edit distance. A timed word is -far from a timed language if its relative distance to the language is greater than .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Machine Learning and Algorithms · Natural Language Processing Techniques
