On the Complexity of Timed Pattern Matching

被引：1

作者：

Asarin, Eugene ^{[1
]}

Ferrere, Thomas ^{[2
]}

Nickovic, Dejan ^{[3
]}

Ulus, Dogan ^{[4
]}

机构：

[1] Univ Paris, IRIF, Paris, France

[2] Imaginat Technol, Kings Langley, England

[3] AIT Austrian Inst Technol, Vienna, Austria

[4] Bogazici Univ, Istanbul, Turkey

来源：

FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2021 | 2021年 / 12860卷

关键词：

Timed regular expressions; Pattern matching; Complexity;

D O I：

10.1007/978-3-030-85037-1_2

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Timed pattern matching consists in finding occurrences of a timed regular expression in a timed word. This problem has been addressed using several techniques, its solutions are implemented in tools (quite efficient in practice), and used, for example in log analysis and runtime verification. In this article, we explore computational complexity of timed pattern matching, and prove P, NP and PSPACE bounds, depending on connectives used in expressions and other details. We conclude with a couple of open questions.

引用

页码：15 / 31

页数：17

共 50 条

[31] Visual pattern matching: Effects of size ratio, complexity, and similarity in simultaneous and successive matching
Axel Larsen
William McIlhagga
Claus Bundesen
Psychological Research, 1999, 62 : 280 - 288
[32] Quantum Time Complexity and Algorithms for Pattern Matching on Labeled Graphs
Darbaril, Parisa
Gibney, Daniel
Thankachan, Sharma, V
STRING PROCESSING AND INFORMATION RETRIEVAL, SPIRE 2022, 2022, 13617 : 303 - 314
[33] State Complexity of Regular Tree Languages for Tree Pattern Matching
Ko, Sang-Ki
Lee, Ha-Rim
Han, Yo-Sub
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 246 - 257
[34] ON THE COMBINATORIAL COMPLEXITY OF FUZZY PATTERN-MATCHING IN MUSIC ANALYSIS
OVERILL, RE
COMPUTERS AND THE HUMANITIES, 1993, 27 (02): : 105 - 110
[35] Complexity issues in vertex-colored graph pattern matching
Dondi, Riccardo
Fertin, Guillaume
Vialette, Stephane
JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (01) : 82 - 99
[36] On the computational complexity of 2-inteirval pattern matching problems
Vialette, S
THEORETICAL COMPUTER SCIENCE, 2004, 312 (2-3) : 223 - 249
[37] On the complexity of pattern matching for highly compressed two-dimensional texts
Berman, P
Karpinski, M
Larmore, LL
Plandowski, W
Rytter, W
COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 1997, 1264 : 40 - 51
[38] State Complexity of Single-Word Pattern Matching in Regular Languages
Brzozowski, Janusz A.
Sylvie, Davies B.
Madan, Abhishek
DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2019, 2019, 11612 : 86 - 97
[39] On the complexity of pattern matching for highly compressed two-dimensional texts
Berman, P
Karpinski, M
Larmore, LL
Plandowski, W
Rytter, W
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 65 (02) : 332 - 350
[40] On the parameterized complexity of d-dimensional point set pattern matching
Cabello, Sergio
Giannopoulos, Panos
Knauer, Christian
PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS, 2006, 4169 : 175 - 183

← 1 2 3 4 5 →