Efficient Parametric Identification for STL
Résumé
We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a dense-time real-valued signal w and a parameterized temporal logic formula phi, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on phi and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of phi relative to w. Our implementation and experiments demonstrate that this approach can work well in practice.
Domaines
Autre [cs.OH]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...