Monitoring Data-aware Temporal Properties (Extended Version)
Not on the map. Why?
Abstract (arXiv)
Dynamic systems in AI are often complex and heterogeneous, so that an internal specification is not accessible and verification techniques such as model checking are not applicable. Monitoring is in such cases an attractive alternative, as it evaluates desirable properties along traces generated by an unknown dynamic system. In this work, we consider anticipatory monitoring of linear-time properties enriched with an arbitrary SMT theory over finite traces (LTLfMT). Anticipatory monitoring in this setting is highly challenging, as the monitoring state depends on both the trace prefix seen so far and all its possible finite continuations. Under reasonable assumptions on the background theory, we present and formally prove the correctness of a novel foundational framework for monitoring properties in an expressive fragment of LTLfMT. The framework combines automata-theoretic methods to handle the temporal aspects of the logic, with automated reasoning techniques to address the first-order dimension. Moreover, we identify for the first time decidable fragments of this monitoring problem that are practically relevant as they combine linear arithmetic with uninterpreted functions, which covers e.g. data-aware business processes and dynamic systems operating over a read-only database. Feasibility is witnessed by a prototype implementation and preliminary evaluation.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 57 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
6 of 57 references.
References · 6
- 2022Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)cited by 8
- 2020Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Tracescited by 7
- 2022Monitoring Arithmetic Temporal Properties on Finite Tracescited by 7
- 2016Verification of Hierarchical Artifact Systemscited by 4
- 2019Combined Covers and Beth Definability (Extended Version)cited by 2
- 2023Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata (Extended Version)cited by 2
Built on by
Not cited yet.