On the quantitative semantics of regular expressions over real-valued signals LNCS Bakhirkin, Alexey Ferrere, Thomas ; https://orcid.org/0000-0001-5199-3143 Maler, Oded Ulus, Dogan Abate, Alessandro Geeraerts, Gilles 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. Springer 2017 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/636 Bakhirkin A, Ferrere T, Maler O, Ulus D. On the quantitative semantics of regular expressions over real-valued signals. In: Abate A, Geeraerts G, eds. Vol 10419. Springer; 2017:189-206. doi:<a href="https://doi.org/10.1007/978-3-319-65765-3_11">10.1007/978-3-319-65765-3_11</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-65765-3_11 info:eu-repo/semantics/altIdentifier/isbn/978-331965764-6 info:eu-repo/semantics/altIdentifier/wos/000611678300011 info:eu-repo/semantics/openAccess