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 条

[41] On the parameterized complexity of d-dimensional point set pattern matching
Cabello, Sergio
Giannopoulos, Panos
Knauer, Christian
INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 73 - 77
[42] Differentially Oblivious Two-Party Pattern Matching With Sublinear Round Complexity
Wu, Pengfei
Ning, Jianting
Huang, Xinyi
Liu, Joseph K.
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2023, 20 (05) : 4101 - 4117
[43] The Complexity of Pattern Matching for 321-Avoiding and Skew-Merged Permutations
Albert, Michael
Lackner, Marie-Louise
Lackner, Martin
Vatter, Vincent
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2016, 18 (02):
[44] TIMED PARITY GAMES: COMPLEXITY AND ROBUSTNESS
Chatterjee, Krishnendu
Henzinger, Thomas A.
Prabhu, Vinayak S.
LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (04)
[45] Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works
Hori, H
Shimozono, S
Takeda, M
Shinohara, A
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 719 - 730
[46] Timed Parity Games: Complexity and Robustness
Chatterjee, Krishnendu
Henzinger, Thomas A.
Prabhu, Vinayak S.
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2008, 5215 : 124 - +
[47] Timed Sets, Functional Complexity, and Computability
Cockett, Robin
Diaz-Boils, Joaquin
Gallagher, Jonathan
Hrubes, Pavel
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2012, 286 : 117 - 137
[48] Timed pattern diagnosis in timed workflows: a model checking approach
Pencole, Yannick
Subias, Audine
IFAC PAPERSONLINE, 2018, 51 (07): : 94 - 99
[49] Prey pattern regularity and background complexity affect detectability of background-matching prey
Dimitrova, Marina
Merilaita, Sami
BEHAVIORAL ECOLOGY, 2012, 23 (02) : 384 - 390
[50] THE COMPLEXITY OF MATCHING WITH BONDS
PADBERG, M
SASSANO, A
INFORMATION PROCESSING LETTERS, 1989, 32 (06) : 297 - 300

← 1 2 3 4 5 →