Almost Event-Rate Independent Monitoring of Metric Temporal Logic
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 critical for monitoring voluminous streams of events arriving at a varying rate. Some previously proposed algorithms for past-only temporal logics satisfy this new property. However, when dealing with future operators, the traditional approach of using a queue to wait for future obligations to be resolved is not event-rate independent. We propose a new algorithm that supports metric past and bounded future operators and is almost event-rate independent, where “almost” denotes a logarithmic dependence on the event rate: the algorithm must store the event rate as a number. We compare our algorithm with traditional ones, providing evidence that almost event-rate independence matters in practice.
KeywordsEvent Rate Temporal Logic Future Operator Linear Temporal Logic Boolean Expression
Jasmin Blanchette, Srdjan Krstic, and anonymous TACAS reviewers helped to improve the presentation of this work. Bhatt is supported by the Swiss National Science Foundation grant Big Data Monitoring (167162).
- 1.Aerial: An almost event-rate independent monitor for metric temporal logic (2016). https://bitbucket.org/traytel/aerial
- 2.Basin, D.A., Klaedtke, F., Müller, S., Pfitzmann, B.: Runtime monitoring of metric first-order temporal properties. In: FSTTCS 2008, pp. 49–60 (2008)Google Scholar
- 8.Furia, C.A., Spoletini, P.: Bounded variability of metric temporal logic. In: Cesta, A., Combi, C., Laroussinie, F. (eds.) TIME 2014, pp. 155–163. IEEE Computer Society (2014)Google Scholar
- 15.McAfee, A., Brynjolfsson, E.: Big data: the management revolution. Harv. Bus. Rev. 90(10), 61–67 (2012)Google Scholar
- 16.Nipkow, T.: Boolean expression checkers. Archive of Formal Proofs (2014). http://isa-afp.org/entries/Boolean_Expression_Checkers.shtml
- 21.Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. In: Nahum, E.M., Xu, D. (eds.) HotCloud 2010. USENIX Association (2010)Google Scholar