Monitoring Temporal Logic with Clock Variables

@inproceedings{Elgytt2018MonitoringTL,
  title={Monitoring Temporal Logic with Clock Variables},
  author={Adri{\'a}n Elgy{\"u}tt and Thomas Ferr{\`e}re and Thomas A. Henzinger},
  booktitle={FORMATS},
  year={2018}
}
We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring… 
Specification and Efficient Monitoring Beyond STL
TLDR
This paper defines a new specification language that extends STL with the ability to produce and manipulate real-valued output signals and with a new form of until operator that still admits efficient offline monitoring, but also allows to express some properties that in the past motivated researchers to extend STL with existential quantification, freezequantification, and other features that increase the complexity of monitoring.
Linear Time Monitoring for One Variable TPTL
TLDR
This work develops an efficient linear time monitoring algorithm, linear in the length of the trace (for traces that have at most a constant number of sample points in any unit interval), for one variable in the pointwise semantics.

References

SHOWING 1-10 OF 34 REFERENCES
Logics and Models of Real Time: A Survey
We survey logic-based and automata-based languages and techniques for the specification and verification of real-time systems. In particular, we discuss three syntactic extensions of temporal logic:
Path Checking for MTL and TPTL over Data Words
TLDR
The results yield the precise complexity of model checking deterministic one-counter machines against formulae of MTL and TPTL and prove that the path-checking problem for MTL is P-complete, whereas the Path checking problem for T PTL is PSPACE-complete.
A Rewriting Based Monitoring Algorithm for TPTL
TLDR
A rewriting based monitoring algo- rithm for time propositional temporal logic (TPTL), which is a classic time extension of linear temporal Logic (LTL) and is shown to be more expressive than other real-time extensions of LTL.
Monitoring Metric First-Order Temporal Properties
TLDR
The results show that metric first-order temporal logic can serve as an effective specification language for expressing and monitoring a wide variety of practically relevant system properties.
Synthesizing Monitors for Safety Properties
TLDR
An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented, which is to construct a flexible framework for monitoring and analyzing program executions.
An efficient algorithm for monitoring practical TPTL specifications
TLDR
This work provides a dynamic programming algorithm for the monitoring of a fragment of Timed Propositional Temporal Logic specifications, which is characterized by independent time variables which enable the elicitation of complex real-time requirements.
A Theory of Timed Automata
Model checking restricted sets of timed paths
First order temporal logic monitoring with BDDs
TLDR
This work explores the use of Binary Decision Diagrams (BDDs) for representing observed data inRuntime verification and shows a substantial improvement in performance compared to related work.
A really temporal logic
We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the
...
1
2
3
4
...