A Boyer-Moore Type Algorithm for Timed Pattern Matching

Waga, Masaki; Akazaki, Takumi; Hasuo, Ichiro

doi:10.1007/978-3-319-44878-7_8

Cited by 15 publications

(35 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [WHS17], we presented an efficient algorithm for online timed pattern matching that employs (an automata-theoretic extension of) skip values from the Franek-Jennings-Smyth (FJS) algorithm for string matching [FJS07]. We showed that our algorithm generally outperforms a brute-force one and our previous BM algorithm [WAH16]: it is twice as fast for some realistic automotive examples. Through our theoretical analysis as well as experiments on memory consumption, our algorithm was shown to be suited for online usage scenarios, too.…”

Section: Introductionmentioning

confidence: 95%

See 1 more Smart Citation

Offline Timed Pattern Matching under Uncertainty

André

Hasuo

Waga

2018

2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS)

Self Cite

View full text Add to dashboard Cite

Given a log and a specification, timed pattern matching aims at exhibiting for which start and end dates a specification holds on that log. For example, "a given action is always followed by another action before a given deadline". This problem has strong connections with monitoring realtime systems. We address here timed pattern matching in presence of an uncertain specification, i. e., that may contain timing parameters (e. g., the deadline can be uncertain or unknown). That is, we want to know for which start and end dates, and for what values of the deadline, this property holds. Or what is the minimum or maximum deadline (together with the corresponding start and end dates) for which this property holds. We propose here a framework for timed pattern matching based on parametric timed model checking. In contrast to most parametric timed problems, the solution is effectively computable, and we perform experiments using IMITATOR to show the applicability of our approach.

show abstract

Section: Introductionmentioning

confidence: 95%

“…In [WAH16], [WHS17], we introduced a solution to the timed pattern matching problem where the log is given This work is partially supported by the ANR national research program PACS (ANR-14-CE28-0002), by JST ERATO HASUO Metamathematics for Systems Design Project (No. JPMJER1603), and by JSPS Grants-in-Aid No.…”

Section: Introductionmentioning

confidence: 99%

Offline Timed Pattern Matching under Uncertainty

André

Hasuo

Waga

2018

2018 23rd International Conference on Engineering of Complex Computer Systems (ICECCS)

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, in [91] we successfully employed a few constructions for timed automata-originally devised for verification-for the purpose of monitoring real-time behaviors (monitoring can be understood for an oracle for testing). Our orientation towards abstraction (Sect.…”

Section: Testing Rather Than Verificationmentioning

confidence: 99%

“…Monitoring is an important building block of testing frameworks, too, since we need to judge if an execution of a system is erroneous or not. Recent works on real-time monitoring include [55,82,91].…”

Section: Testing Rather Than Verificationmentioning

confidence: 99%

Metamathematics for Systems Design

Hasuo

2017

New Gener. Comput.

Self Cite

View full text Add to dashboard Cite

This position paper describes the context, the goal, the strategy and the tactics of the ERATO MMSD project (2016-2022. The project aims at enhanced quality assurance measures for industry products like cars. In doing so, we follow a recent trend and exploit formal methods, a body of mathematical techniques originally developed for computer systems. However, there are fundamental gaps in application of formal methods to industry products: additional concerns in industry products such as continuous dynamics of physical components and quantitative measures such as probability, time, and cost make problems fundamentally different from those about software. Formal methods that accommodate these concerns is an active research area, which shows that it is a hard problem. There are several successful theoretical developments in this direction. They typically combine one individual technique with one specific concern, such as hybrid automata that extend automata with continuous dynamics. Our project aims to contribute to this hard problem in a unique way. In our project we will take a unique metamathematical strategy to bridging the gaps: instead of creating one technique for each concern, we want to find a meta-level theory that describes how to develop such techniques for many potential concerns in general. Through this strategy, together with our emphasis on real-world applications in industry, we expect a new prototype of applied mathematics will emerge. In this prototype, abstraction and genericitycharacteristics of modern mathematics that are not often associated with application-are turned into crucial advantages in applications.

show abstract

“…This problem can be related to string matching and pattern matching. The timed pattern matching problem was formulated in [UFAM14], with subsequent works varying the setting and improving the technique (e. g., [UFAM16,WAH16,AMNU17,WHS17]). The problem takes as input a log and a specification, and decides where in the log the specification is ⋆ This is the author (and extended) version of the manuscript of the same name published in the proceedings of the 11th Annual NASA Formal Methods Symposium (NFM 2019).…”

Section: Introductionmentioning

confidence: 99%

Online Parametric Timed Pattern Matching with Automata-Based Skipping

Waga¹,

André²

2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

0000−0001−9360−7490] andÉtienne André 4,5,1[0000−0001−8473−9555]Abstract. Timed pattern matching has strong connections with monitoring real-time systems. Given a log and a specification containing timing parameters (that can capture uncertain or unknown constants), parametric timed pattern matching aims at exhibiting for which start and end dates, as well as which parameter valuations, a specification holds on that log. This problem is notably close to robustness. We propose here a new framework for parametric timed pattern matching. Not only we dramatically improve the efficiency when compared to a previous method based on parametric timed model checking, but we further propose optimizations based on skipping. Our algorithm is suitable for online monitoring, and experiments show that it is fast enough to be applied at runtime.

show abstract

A Boyer-Moore Type Algorithm for Timed Pattern Matching

Cited by 15 publications

References 22 publications

Offline Timed Pattern Matching under Uncertainty

Offline Timed Pattern Matching under Uncertainty

Metamathematics for Systems Design

Online Parametric Timed Pattern Matching with Automata-Based Skipping

Contact Info

Product

Resources

About