Timed Pattern Matching

Ulus, Dogan; Ferrère, Thomas; Asarin, Eugène; Maler, Oded

doi:10.1007/978-3-319-10512-3_16

Cited by 57 publications

(63 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the online algorithm [15], built upon derivatives of regular expressions [12,13], we extensively use the rewriting functionality when deriving an expression with respect to a newly observed segment. The offline algorithm [14] is a recursive computation over the syntax tree of the expression; therefore, the role of Pure's rewriting engine is minimal. The worst case complexity is polynomial in the size of input behavior and expression for the offline approach.…”

Section: Tool Descriptionmentioning

confidence: 99%

“…Given a TRE that specifies a temporal pattern and a real-time behavior the problem of timed pattern matching is defined as locating all segments that satisfy the expression. This problem has been solved by an offline algorithm in [14]. It is further endowed with an online algorithm that incrementally matches patterns over streaming behaviors [15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Montre: A Tool for Monitoring Timed Regular Expressions

Ulus

2017

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Abstract. We present Montre, a monitoring tool to search patterns specified by timed regular expressions over real-time behaviors. We use timed regular expressions as a compact, natural, and highly-expressive pattern specification language for monitoring applications involving quantitative timing constraints. Our tool essentially incorporates online and offline timed pattern matching algorithms so it is capable of finding all occurrences of a given pattern over both logged and streaming behaviors. Furthermore, Montre is designed to work with other tools via standard interfaces to perform more complex and versatile tasks for analyzing and reasoning about cyber-physical systems. As the first of its kind, we believe Montre will enable a new line of inquiries and techniques in these fields.

show abstract

Section: Tool Descriptionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Montre: A Tool for Monitoring Timed Regular Expressions

Ulus

2017

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

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%

“…This can be seen as a state-based view, while our timed words are event-based. The formalism used for specification in [UFAM14,UFAM16] is timed regular expressions (TREs). An offline monitoring algorithm is presented in [UFAM14] and an online one is in [UFAM16].…”

Section: Introductionmentioning

confidence: 99%

Online Parametric Timed Pattern Matching with Automata-Based Skipping

Waga¹,

André²

2019

Lecture Notes in Computer Science

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

“…The approaches most related to ours are [UFAM14], [UFAM16], [Ulu17]. In that series of works, logs are encoded by signals, i. e., values that vary over time.…”

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)

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

Timed Pattern Matching

Cited by 57 publications

References 19 publications

Montre: A Tool for Monitoring Timed Regular Expressions

Montre: A Tool for Monitoring Timed Regular Expressions

Online Parametric Timed Pattern Matching with Automata-Based Skipping

Offline Timed Pattern Matching under Uncertainty

Contact Info

Product

Resources

About