---
res:
  bibo_abstract:
  - We solve the offline monitoring problem for timed propositional temporal logic
    (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider
    extends linear temporal logic (LTL) with clock variables and reset quantifiers,
    providing a mechanism to specify real-time constraints. We first describe a general
    monitoring algorithm based on an exhaustive computation of the set of satisfying
    clock assignments as a finite union of zones. We then propose a specialized monitoring
    algorithm for the one-variable case using a partition of the time domain based
    on the notion of region equivalence, whose complexity is linear in the length
    of the signal, thereby generalizing a known result regarding the monitoring of
    metric temporal logic (MTL). The region and zone representations of time constraints
    are known from timed automata verification and can also be used in the discrete-time
    case. Our prototype implementation appears to outperform previous discrete-time
    implementations of TPTL monitoring,@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Adrian
      foaf_name: Elgyütt, Adrian
      foaf_surname: Elgyütt
      foaf_workInfoHomepage: http://www.librecat.org/personId=4A2E9DBA-F248-11E8-B48F-1D18A9856A87
  - 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: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  bibo_doi: 10.1007/978-3-030-00151-3_4
  bibo_volume: 11022
  dct_date: 2018^xs_gYear
  dct_identifier:
  - UT:000884993200004
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Monitoring temporal logic with clock variables@
...