Almost Event-Rate Independent Monitoring of Metric Temporal Logic

@inproceedings{Basin2017AlmostEI,
  title={Almost Event-Rate Independent Monitoring of Metric Temporal Logic},
  author={David A. Basin and Bhargav Nagaraja Bhatt and Dmitriy Traytel},
  booktitle={TACAS},
  year={2017}
}
A monitoring algorithm is trace-length independent if its space consumption does not depend on the number of events processed. The analysis of many monitoring algorithms has aimed at establishing trace-length independence. But a trace-length independent monitor's space consumption can depend on characteristics of the trace other than its size. We put forward the stronger notion of event-rate independence, where the monitor's space usage does not depend on the event rate. This property is… 

Almost Event-Rate Independent Monitoring of Metric Regular Properties

TLDR
This work proposes a new algorithm for metric temporal logic (MTL) that is almost eventrate independent, where “almost” denotes a logarithmic dependence on the event rate: the algorithm must store theevent rate as a number.

Almost event-rate independent monitoring

TLDR
This work proposes a new algorithm for metric temporal logic (MTL) that is almost event-rate independent, where “almost” denotes a logarithmic dependence on the event rate: the algorithm must store theevent rate as a number.

Multi-head Monitoring of Metric Dynamic Logic

. We develop a monitoring algorithm for metric dynamic logic, an extension of metric temporal logic with regular expressions. The monitor computes whether a given formula is satisfied at every

Multi-head Monitoring of Metric Temporal Logic

TLDR
This work presents a novel approach to the offline monitoring of specifications expressed in metric temporal logic (MTL) with past and bounded-future temporal operators that is almost trace-length independent and outputs a trace of Boolean verdicts denoting the monitored formula’s satisfaction at every position in the input trace.

Almost Event-Rate Independent Monitoring of Metric Dynamic Logic

TLDR
This work develops and evaluates an online monitoring algorithm for MDL whose space-consumption is almost event-rate independent—a notion that characterizes monitors that scale to high-velocity event streams.

Trace-Length Independent Runtime Monitoring of Quantitative Policies

TLDR
This work proposes a policy language based on a past-time variant of MTL, extended with an aggregate operator called the metric temporal counting quantifier to specify a policy based on the number of times some sub-policies are satisfied in the specified past time interval, and shows that a broad class of policies, but not all policies, specified with this language can be monitored in a trace-length independent way.

Scalable Online First-Order Monitoring

TLDR
This work shows how to scale up first-order monitoring to substantially higher velocities by slicing the stream, based on the events’ data values, into substreams that can be monitored independently.

AERIAL: Almost Event-Rate Independent Algorithms for Monitoring Metric Regular Properties

TLDR
Aerial’s distinguishing feature is its ability to monitor an event stream using memory logarithmic in the event rate, achieved by altering how Aerial outputs its monitoring verdicts.

L O ] 1 2 Ju n 20 19 Real-time Stream-based Monitoring

We introduce RTLola, a new stream-based specification language for the description of real-time properties of reactive systems. The key feature is the integration of sliding windows over real-time

Real-time Stream-based Monitoring

TLDR
This work introduces RTLola, a new stream-based specification language for the description of real-time properties of reactive systems that allows for an automatic memory analysis that guides the user in identifying the computationally expensive specifications.

References

SHOWING 1-10 OF 20 REFERENCES

Monitoring Algorithms for Metric Temporal Logic Specifications

Trace-Length Independent Runtime Monitoring of Quantitative Policies in LTL

TLDR
This work proposes a policy language based on a past-time variant of LTL, extended with an aggregate operator called the counting quantifier to specify a policy based on the number of times some sub-policies are satisfied in the past, and shows that a broad class of policies, but not all policies, specified with this language can be monitored in a trace-length independent way.

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.

Runtime Monitoring of Metric First-order Temporal Properties

TLDR
A novel approach to the runtime monitoring of complex system proper- ties that allows the unrestricted use of negation, universal and existential quantification over infinite domains, and the arbitrary nesting of both past and bounded future operators.

Algorithms for monitoring real-time properties

TLDR
This work presents monitoring algorithms for the past-only fragment of metric temporal logics that differ along two dimensions, analyzes their complexity, and compares them on a class of formulas for which the point-based and the interval-based settings coincide.

Efficient Runtime Monitoring with Metric Temporal Logic: A Case Study in the Android Operating System

TLDR
It is shown how the metric operators of MTL, in combination with recursive definitions, can be used to specify policies to detect privilege escalation, under various fine grained constraints.

Online Monitoring of Metric Temporal Logic

TLDR
This paper adapts a separation technique enabling us to rewrite arbitrary MTL formulas into LTL formulas over a set of atoms comprising bounded MTL equations, and obtains the first trace-length independent online monitoring procedure for full MTL in a dense-time setting.

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.

Bounded variability of metric temporal logic

TLDR
The results of the paper are mainly negative: over dense time domains, the problem is mostly undecidable (even if with an undecidability degree that is typically lower than deciding validity); over discreteTime domains, it is decidable with the same complexity as deciding validity.

Specifying real-time properties with metric temporal logic

TLDR
This paper characterize real-time systems by giving a classification of such quantitative temporal properties, and extends the usual models for temporal logic by including a distance function to measure time and analyzes what restrictions should be imposed on such a function.