 |
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.
Cited literature [31 references]
https://hal.archives-ouvertes.fr/hal-01825026
Contributor : Alexey Bakhirkin <>
Submitted on : Thursday, June 28, 2018 - 1:23:48 AM
Last modification on : Tuesday, May 11, 2021 - 11:36:58 AM
Long-term archiving on: : Thursday, September 27, 2018 - 4:25:05 AM
Contributor : Alexey Bakhirkin <>
Submitted on : Thursday, June 28, 2018 - 1:23:48 AM
Last modification on : Tuesday, May 11, 2021 - 11:36:58 AM
Long-term archiving on: : Thursday, September 27, 2018 - 4:25:05 AM
File
formats18.pdf
Files produced by the author(s)