Parametric Timed Pattern Matching
Abstract
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 real-time systems. We address here timed pattern matching in the presence of an uncertain specification, i.e., that may contain timing parameters (e.g., the deadline can be uncertain or unknown). We want to know for which start and end dates, and for what values of the timing parameters, a property holds. For instance, we look for the minimum or maximum deadline (together with the corresponding start and end dates) for which the property holds. We propose two frameworks for parametric timed pattern matching. The first one is based on parametric timed model checking. In contrast to most parametric timed problems, the solution is effectively computable. The second one is a dedicated method; not only we largely improve the efficiency compared to the first method, but we further propose optimizations with skipping. Our experiment results suggest that our algorithms, especially the second one, are efficient and practically relevant.
Cite
@article{arxiv.1903.07328,
title = {Parametric Timed Pattern Matching},
author = {Masaki Waga and Étienne André and Ichiro Hasuo},
journal= {arXiv preprint arXiv:1903.07328},
year = {2024}
}
Comments
This is the author version of the manuscript of the same name published in ACM Transactions on Software Engineering and Methodology (Volume 32, Issue 1, 2023). This manuscript is an extension of [ICECCS 2018, NFM 2019], with [ICECCS 2018] describing the first method of this manuscript (based on parametric timed model checking) while [NFM 2019] describes the second dedicated method. arXiv admin note: substantial text overlap with arXiv:1812.08940