Timed Pattern Matching

  • Dogan Ulus
  • Thomas Ferrère
  • Eugene Asarin
  • Oded Maler
Conference paper

DOI: 10.1007/978-3-319-10512-3_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8711)
Cite this paper as:
Ulus D., Ferrère T., Asarin E., Maler O. (2014) Timed Pattern Matching. In: Legay A., Bozga M. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2014. Lecture Notes in Computer Science, vol 8711. Springer, Cham

Abstract

Given a timed regular expression and a dense-time Boolean signal we compute the set of all matches of the expression in the signal, that is, the set of all segments of the signal that satisfy the regular expression. The set of matches is viewed as a set of points in a two-dimensional space with each point indicating the beginning and end of a matching segment on the real time axis. Our procedure, which works by induction on the structure of the expression, is based on the following result that we prove in this paper: the set of all matches of a timed regular expression by a signal of finite variability and duration can be written as a finite union of zones.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Dogan Ulus
    • 1
  • Thomas Ferrère
    • 1
  • Eugene Asarin
    • 2
  • Oded Maler
    • 1
  1. 1.VERIMAGCNRS and the University of Grenoble-AlpesFrance
  2. 2.LIAFAUniversité Paris Diderot / CNRSParisFrance

Personalised recommendations