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 条
  • [1] Elements of Timed Pattern Matching
    Ulus, Dogan
    Ferrere, Thomas
    Asarin, Eugene
    Nickovic, Dejan
    Maler, Oded
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2024, 23 (04)
  • [2] Parametric Timed Pattern Matching
    Waga, Masaki
    Andre, Etienne
    Hasuo, Ichiro
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2023, 32 (01)
  • [3] Online Timed Pattern Matching Using Automata
    Bakhirkin, Alexey
    Ferrere, Thomas
    Nickovic, Dejan
    Maler, Oded
    Asarin, Eugene
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2018, 2018, 11022 : 215 - 232
  • [4] Online Timed Pattern Matching Using Derivatives
    Ulus, Dogan
    Ferrere, Thomas
    Asarin, Eugene
    Maler, Oded
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS 2016), 2016, 9636 : 736 - 751
  • [5] Offline timed pattern matching under uncertainty
    Andre, Etienne
    Hasuo, Ichiro
    Waga, Masaki
    2018 23RD INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS), 2018, : 10 - 20
  • [6] The sketching complexity of pattern matching
    Bar-Yossef, Z
    Jayram, TS
    Krauthgamer, R
    Kumar, R
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2004, 3122 : 261 - 272
  • [7] COMPLEXITY REGULARIZED PATTERN MATCHING
    Zujovic, Jana
    Guleryuz, Onur G.
    2009 16TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-6, 2009, : 1889 - +
  • [8] Complexity of sequential pattern matching algorithms
    Régnier, M
    Szpankowski, W
    RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE, 1998, 1518 : 187 - 199
  • [9] COMPLEXITY OF PATTERN MATCHING FOR A RANDOM STRING
    YAO, ACC
    SIAM JOURNAL ON COMPUTING, 1979, 8 (03) : 368 - 387
  • [10] On the Communication Complexity of Approximate Pattern Matching
    Kociumaka, Tomasz
    Nogler, Jakob
    Wellnitz, Philip
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1758 - 1768
12345