mlsanityData to 7 Oct 2026

An Efficient Algorithm for Monitoring Practical TPTL Specifications

arXiv 1612.03140 ↗First posted 9 Dec 2016cs.LO cs.SY eess.SYcited by 2

Not on the map. Why?

Abstract (arXiv)

We provide a dynamic programming algorithm for the monitoring of a fragment of Timed Propositional Temporal Logic (TPTL) specifications. This fragment of TPTL, which is more expressive than Metric Temporal Logic, is characterized by independent time variables which enable the elicitation of complex real-time requirements. For this fragment, we provide an efficient polynomial time algorithm for off-line monitoring of finite traces. Finally, we provide experimental results on a prototype implementation of our tool in order to demonstrate the feasibility of using our tool in practical applications.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Dec 2016.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 1.

2 papers.