A Boyer-Moore Type Algorithm for Timed Pattern Matching

DOI10.1007/978-3-319-44878-7_8zbMath1433.68262arXiv1606.07207OpenAlexW2460913653MaRDI QIDQ4603563

Ichiro Hasuo, Takumi Akazaki, Masaki Waga

Publication date: 16 February 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.07207

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Algorithms on strings (68W32)

Related Items (4)

On the complexity of timed pattern matching ⋮ Offline and online monitoring of scattered uncertain logs using uncertain linear dynamical systems ⋮ Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions ⋮ timed-pattern-matching

Uses Software

• Simulink
• MONAA

This page was built for publication: A Boyer-Moore Type Algorithm for Timed Pattern Matching