---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Alexey
      foaf_name: Bakhirkin, Alexey
      foaf_surname: Bakhirkin
  - foaf_Person:
      foaf_givenName: Thomas
      foaf_name: Ferrere, Thomas
      foaf_surname: Ferrere
      foaf_workInfoHomepage: http://www.librecat.org/personId=40960E6E-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-5199-3143
  - foaf_Person:
      foaf_givenName: Oded
      foaf_name: Maler, Oded
      foaf_surname: Maler
  - foaf_Person:
      foaf_givenName: Dogan
      foaf_name: Ulus, Dogan
      foaf_surname: Ulus
  bibo_doi: 10.1007/978-3-319-65765-3_11
  bibo_volume: 10419
  dct_date: 2017^xs_gYear
  dct_identifier:
  - UT:000611678300011
  dct_isPartOf:
  - http://id.crossref.org/issn/978-331965764-6
  dct_language: eng
  dct_publisher: Springer@
  dct_title: On the quantitative semantics of regular expressions over real-valued
    signals@
...