Online Timed Pattern Matching using Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
formats18.pdf (366.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01825026 , version 1 (28-06-2018)

Identifiers

  • HAL Id : hal-01825026 , version 1

Cite

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⟩
163 View
213 Download

Share

Gmail Facebook X LinkedIn More