Efficient On-line Detection of Temporal Patterns
Shlomi Dolev, Jonathan Goldfeld, Rami Puzis

TL;DR
This paper introduces efficient real-time schemes for detecting temporal event patterns, minimizing comparisons during monitoring by preprocessing and early halting when patterns cannot be extended.
Contribution
It proposes novel online monitoring schemes that reduce runtime comparisons through preprocessing and early termination strategies.
Findings
Significantly reduces comparison count during online detection
Enables real-time identification of temporal event patterns
Improves efficiency of on-line verification processes
Abstract
Identifying a temporal pattern of events is a fundamental task of on-line (real-time) verification. We present efficient schemes for on-line monitoring of events for identifying desired/undesired patterns of events. The schemes use preprocessing to ensure that the number of comparisons during run-time is minimized. In particular, the first comparison following the time point when an execution sub-sequence cannot be further extended to satisfy the temporal requirements, halts the process that monitors the sub-sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Advanced Software Engineering Methodologies · Software Testing and Debugging Techniques
