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 条

[21] Pattern Matching in Link Streams: Timed-Automata with Finite Memory
Bertrand, Clement
Peschanski, Frederic
Klaudel, Hanna
Latapy, Matthieu
SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2018, 28 (02) : 161 - 198
[22] Efficient Online Timed Pattern Matching by Automata-Based Skipping
Waga, Masaki
Hasuo, Ichiro
Suenaga, Kohei
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2017), 2017, 10419 : 224 - 243
[23] APPLICATION OF PATTERN MATCHING TO A PROBLEM IN GEOMETRICAL COMPLEXITY - COMMENT
AKL, SG
INFORMATION PROCESSING LETTERS, 1978, 7 (02) : 86 - 86
[24] On the average-case complexity of pattern matching with wildcards
Barton, Carl
THEORETICAL COMPUTER SCIENCE, 2022, 922 : 37 - 45
[25] Improving time and space complexity for compressed pattern matching
Maruyama, Shirou
Miyagawa, Hiromitsu
Sakamoto, Hiroshi
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2006, 4288 : 484 - +
[26] On the complexity of the crossing contact map pattern matching problem
Li, Shuai Cheng
Li, Ming
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2006, 4175 : 231 - 241
[27] The Complexity of Approximate Pattern Matching on de Bruijn Graphs
School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, United States
不详
Lect. Notes Comput. Sci., 1600, (263-278):
[28] Pattern Matching with Variables: Efficient Algorithms and Complexity Results
Fernau, Henning
Manea, Florin
Mercas, Robert
Schmid, Markus L.
ACM TRANSACTIONS ON COMPUTATION THEORY, 2020, 12 (01)
[29] Online Quantitative Timed Pattern Matching with Semiring-Valued Weighted Automata
Waga, Masaki
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2019), 2019, 11750 : 3 - 22
[30] Visual pattern matching: Effects of size ratio, complexity, and similarity in simultaneous and successive matching
Larsen, A
McIlhagga, W
Bundesen, C
PSYCHOLOGICAL RESEARCH-PSYCHOLOGISCHE FORSCHUNG, 1999, 62 (04): : 280 - 288

← 1 2 3 4 5 →