Project: Timed Pattern Matching

[doganulus]

Project Description

Pattern matching, the determination of all sub-sequences of a string of symbols that match some pre-specified pattern, is a fundamental operation in searching over long texts (e.g. grep, Ctrl+F). Analogously, timed pattern matching is the act of finding all matching segments over a dense-time Boolean signal (observed from physical processes or vehicles or robots) that satisfies a temporal pattern specified by a timed regular expression.

• This two-semester project will target one or more aspects for the study of timed pattern matching deeper; including the underlying theory (abstract algebra if you are interested), software implementations (libraries/tools), and/or practical applications.
• Read before the discussion: Dogan Ulus et al. 2024. Elements of Timed Pattern Matching. ACM Trans. Embed. Comput. Syst. 23, 4, Article 59 (July 2024)