Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Online Timed Pattern Matching using Automata

Abstract : We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal w that match a given temporal pattern phi. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by phi and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads w, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.
Document type :
Conference papers
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Alexey Bakhirkin Connect in order to contact the contributor
Submitted on : Thursday, June 28, 2018 - 1:23:48 AM
Last modification on : Tuesday, October 19, 2021 - 11:35:38 AM
Long-term archiving on: : Thursday, September 27, 2018 - 4:25:05 AM


Files produced by the author(s)


  • HAL Id : hal-01825026, version 1


Alexey Bakhirkin, Thomas Ferrère, Dejan Nickovic, Oded Maler, Eugène Asarin. Online Timed Pattern Matching using Automata. 16th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), Sep 2018, Beijing, China. ⟨hal-01825026⟩



Record views


Files downloads