On the Quantitative Semantics of Regular Expressions over Real-Valued Signals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

On the Quantitative Semantics of Regular Expressions over Real-Valued Signals

Résumé

Signal regular expressions can specify sequential properties of real-valued signals based on threshold conditions, regular operations, and duration constraints. In this paper we endow them with a quantitative semantics which indicates how robustly a signal matches or does not match a given expression. First, we show that this semantics is a safe approximation of a distance between the signal and the language defined by the expression. Then, we consider the robust matching problem, that is, computing the quantitative semantics of every segment of a given signal relative to an expression. We present an algorithm that solves this problem for piecewise-constant and piecewise-linear signals and show that for such signals the robustness map is a piecewise-linear function. The availability of an indicator describing how robustly a signal segment matches some regular pattern provides a general framework for quantitative monitoring of cyber-physical systems.
Fichier principal
Vignette du fichier
main.pdf (1.14 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01552132 , version 1 (30-06-2017)

Identifiants

  • HAL Id : hal-01552132 , version 1

Citer

Alexey Bakhirkin, Thomas Ferrère, Oded Maler, Dogan Ulus. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), Sep 2017, Berlin, Germany. ⟨hal-01552132⟩
236 Consultations
156 Téléchargements

Partager

Gmail Facebook X LinkedIn More