Houssam Abbas
ABSTRACT
Is it possible to determine whether a signal violates a formula in Signal Temporal Logic (STL), if the monitor only has access to a low-resolution version of the signal? We answer this question affirmatively by demonstrating that temporal logic has a multiresolution structure, which parallels the multiresolution structure of signals. A formula in discrete-time Signal Temporal Logic (STL) is equivalently defined via the set of signals that satisfy it, known as its language. If a wavelet decomposition x = y + d is performed on each signal x in the language, we end up with two signal sets Y and D, where Y contains the low-resolution approximation signals y, and D contains the detail signals d needed to reconstruct the x’s. This paper provides a complete computational characterization of both Y and D using a novel constraint set encoding of STL, s.t. x satisfies a formula if and only if its decomposition signals satisfy their respective encoding constraints. Then a conservative logical approximation of Y is also provided: namely, we show that Y is over approximated by the language of a formula − 1. By iterating the decomposition, we obtain a sequence of lower-resolution formulas − 1, − 2, − 3,... which thus constitute a multiresolution analysis of. This work lays the foundation for multiresolution monitoring in distributed systems. One potential application of these results is a multiresolution monitor that can detect specification violation early by simply observing a low-resolution version of the signal to be monitored. 1
- Yashwanth S. R. Annapureddy and Georgios E. Fainekos. 2010. Ant Colonies for Temporal Logic Falsification of Hybrid Systems. In Proc. of the 36th Annual Conference of IEEE Industrial Electronics. 91–96.Google Scholar
- Eugene Asarin and Aldric Degorre. 2009. Volume and Entropy of Regular Timed Languages: Analytic Approach. In Formal Modeling and Analysis of Timed Systems, Joël Ouaknineand Frits W. Vaandrager (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 13–27.Google Scholar
- N. Basnet and H. Abbas. 2020. Logical Signal Processing: A Fourier Analysis of Temporal Logic. In Proceedings of the 20th International Conference on Runtime Verification (RV). 359–382.Google Scholar
- Davide G. Cavezza, Dalal Alrajeh, and András Gyorgy. 2021. A Weakness Measure for GR(1) Formulae. Formal Aspects of Computing 33 (2021).Google Scholar
- Alexandre Donzé, Thomas Ferrère, and Oded Maler. 2013. Efficient Robust Monitoring for STL. In Computer Aided Verification, Natasha Sharygina and Helmut Veith (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 264–279.Google Scholar
- Alexandre Donzé and Oded Maler. 2010. Robust Satisfaction of Temporal Logic over Real-valued Signals. In Proceedings of the International Conference on Formal Modeling and Analysis of Timed Systems.Google ScholarDigital Library
- Alexandre Donzé, Oded Maler, Ezio Bartocci, Dejan Nickovic, Radu Grosu, and Scott Smolka. 2012. On Temporal Logic and Signal Processing. In Automated Technology for Verification and Analysis, Supratik Chakraborty and Madhavan Mukund (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 92–106.Google Scholar
- Michael W. Frazier. 1999. A Linear Algebra Introduction to Wavelets. Springer.Google Scholar
- Paul Halmos. 1950. Measure Theory. Van Nostrand and Co.Google Scholar
- S. Jaksić, E. Bartocci, R. Grosu, and D. Nicković. 2018. An Algebraic Framework for Runtime Verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37, 11(2018), 2233–2243.Google ScholarCross Ref
- Yogi Joshi, Guy Martin Tchamgoue, and Sebastian Fischmeister. 2017. Runtime Verification of LTL on Lossy Traces. In Proceedings of the Symposium on Applied Computing(Marrakech, Morocco) (SAC ’17). Association for Computing Machinery, New York, NY, USA, 1379–1386. https://doi.org/10.1145/3019612.3019827Google ScholarDigital Library
- Oded Maler and Dejan Nickovic. 2004. Monitoring Temporal Properties of Continuous Signals. Springer Berlin Heidelberg.Google Scholar
- Stéphane Mallat. 2016. Understanding deep convolutional networks. Philosophical Transactions of the Royal Society A 374 (April 2016). Issue 2065.Google Scholar
- Hector Mesa. 2005. Adapted wavelets for pattern detection. In Iberoamerican Congress on Pattern Recognition. Springer, 933–944.Google ScholarDigital Library
- R. Pelphrey and H. Abbas. 2022. MRA Monitoring. (2022). https://github.com/sabotagelab/MRA-MonitoringGoogle Scholar
- V. Raman, A. Donze, M. Maasoumy, R. M. Murray, A. Sangiovanni-Vincentelli, and S. A. Seshia. 2014. Model predictive control with signal temporal logic specifications. In 53rd IEEE Conference on Decision and Control. 81–87. https://doi.org/10.1109/CDC.2014.7039363Google ScholarCross Ref
- Alena Rodionova, Ezio Bartocci, Dejan Nickovic, and Radu Grosu. 2016. Temporal Logic as Filtering. In Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control (Vienna, Austria) (HSCC ’16). Association for Computing Machinery, New York, NY, USA, 11–20. https://doi.org/10.1145/2883817.2883839Google ScholarDigital Library
- A. Prasad Sistla, Miloý Žefran, Yao Feng, and Yue Ben. 2014. Timely Monitoring of Partially Observable Stochastic Systems. In Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control(Berlin, Germany) (HSCC ’14). Association for Computing Machinery, New York, NY, USA, 61–70. https://doi.org/10.1145/2562059.2562136Google ScholarDigital Library
- J.-L. Starck, F. Murtagh, and A. Bijaoui. 1998. Image Processing and Data Analysis: The Multiscale Approach. Cambridge University Press.Google Scholar
- Scott D. Stoller, Ezio Bartocci, Justin Seyster, Radu Grosu, Klaus Havelund, Scott A. Smolka, and Erez Zadok. 2012. Runtime Verification with State Estimation. In Runtime Verification, Sarfraz Khurshid and Koushik Sen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 193–207.Google Scholar
Recommendations
Wavelets and Mallat's Multiresolution Analysis
We present a simple proof of Mallat's theorem about wavelet and multiresolution analysis. We do not use Fourier transform and the proof is accesible even for younger undergraduate students.
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
A complete proof system for propositional projection temporal logic
The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To ...
Comments