ABSTRACT
Timed formalisms such as Timed Automata (TA), Signal Temporal Logic (STL) and Timed Regular expressions (TRE) have been previously applied as behaviour specifications for monitoring or runtime verification, in particular, under the form of pattern-matching, i.e. computing the set of all the segments of a given system run that satisfy the specification.
In this work, timed regular expressions with parameters (for timing delays and for signal values) are considered. We define several classes of parametric expressions (based on Boolean or real-valued signals and discrete events), and tackle the problem of computing a parametric match-set, i.e. the parameter values and time segments of data that give a match for a given expression. We propose efficient data structures for representing match-sets (combining zones and polytopes), and devise pattern-matching algorithms. All these different types and algorithms are combined into a single implementation under a tool named parameTRE. We illustrate the approach on several examples, from electrocardiograms to driving patterns.
- Rajeev Alur and David L. Dill. 1994. A Theory of Timed Automata. Theoretical Computer Science 126, 2 (April 1994), 183–235.Google ScholarDigital Library
- Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. 1993. Parametric real-time reasoning. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal (Eds.). ACM, San Diego, CA, USA, 592–601. https://doi.org/10.1145/167088.167242Google ScholarDigital Library
- Étienne André, Ichiro Hasuo, and Masaki Waga. 2018. Offline Timed Pattern Matching under Uncertainty. In 23rd International Conference on Engineering of Complex Computer Systems, ICECCS 2018, December 12-14, 2018. IEEE Computer Society, Melbourne, Australia, 10–20. https://doi.org/10.1109/ICECCS2018.2018.00010Google ScholarCross Ref
- Eugene Asarin, Paul Caspi, and Oded Maler. 1997. A Kleene Theorem for Timed Automata. In Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, June 29 - July 2, 1997. IEEE Computer Society, Warsaw, Poland, 160–171. https://doi.org/10.1109/LICS.1997.614944Google ScholarCross Ref
- Eugene Asarin, Paul Caspi, and Oded Maler. 2002. Timed regular expressions. J. ACM 49, 2 (2002), 172–206.Google ScholarDigital Library
- Eugene Asarin, Alexandre Donzé, Oded Maler, and Dejan Nickovic. 2011. Parametric Identification of Temporal Properties. In Runtime Verification - Second International Conference, RV 2011, September 27-30, 2011, Revised Selected Papers(Lecture Notes in Computer Science, Vol. 7186), Sarfraz Khurshid and Koushik Sen (Eds.). Springer, San Francisco, CA, USA, 147–160. https://doi.org/10.1007/978-3-642-29860-8_12Google ScholarDigital Library
- Roberto Bagnara, Patricia Hill, and Enea Zaffanella. 2008. The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems. Science of Computer Programming 72 (06 2008), 3–21. https://doi.org/10.1016/j.scico.2007.08.001Google ScholarDigital Library
- Alexey Bakhirkin and Nicolas Basset. 2019. Specification and Efficient Monitoring Beyond STL. In Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, April 6-11, 2019, Proceedings, Part II(Lecture Notes in Computer Science, Vol. 11428), Tomás Vojnar and Lijun Zhang (Eds.). Springer, Prague, Czech Republic, 79–97. https://doi.org/10.1007/978-3-030-17465-1_5Google ScholarCross Ref
- Alexey Bakhirkin, Thomas Ferrére, and Oded Maler. 2018. Efficient Parametric Identification for STL. In Proc. 21st Int. Conf. on Hybrid Systems: Computation and Control(HSCC’18). ACM, New York, NY, USA, 177–186.Google ScholarDigital Library
- Alexey Bakhirkin, Thomas Ferrère, Oded Maler, and Dogan Ulus. 2017. On the Quantitative Semantics of Regular Expressions over Real-Valued Signals. In FORMATS(Lecture Notes in Computer Science, Vol. 10419). Springer, Berlin, Germany, 189–206.Google Scholar
- Alexey Bakhirkin, Thomas Ferrère, Dejan Nickovic, Oded Maler, and Eugene Asarin. 2018. Online Timed Pattern Matching Using Automata. In FORMATS(Lecture Notes in Computer Science, Vol. 11022). Springer, Beijing, China, 215–232.Google Scholar
- Ezio Bartocci, Cristinel Mateis, Eleonora Nesterini, and Dejan Nickovic. 2022. Survey on mining signal temporal logic specifications. Inf. Comput. 289, Part (2022), 104957.Google Scholar
- Nicolas Basset, Thao Dang, Akshay Mambakam, and José-Ignacio Requeno Jarabo. 2020. Learning Specifications for Labelled Patterns. In FORMATS(Lecture Notes in Computer Science, Vol. 12288). Springer, Vienna, Austria, 76–93.Google Scholar
- Alexandre Donzé and Oded Maler. 2010. Robust Satisfaction of Temporal Logic over Real-Valued Signals. In Formal Modeling and Analysis of Timed Systems - 8th International Conference, FORMATS 2010, September 8-10, 2010. Proceedings(Lecture Notes in Computer Science, Vol. 6246), Krishnendu Chatterjee and Thomas A. Henzinger (Eds.). Springer, Klosterneuburg, Austria, 92–106. https://doi.org/10.1007/978-3-642-15297-9_9Google ScholarCross Ref
- Thomas Ferrère, Oded Maler, Dejan Nickovic, and Dogan Ulus. 2015. Measuring with Timed Patterns. In CAV (2)(Lecture Notes in Computer Science, Vol. 9207). Springer, San Francisco, CA, USA, 322–337.Google Scholar
- Ary L. Goldberger, Luis A.N. Amaral, Leon Glass, Jeffrey M. Hausdorff, Plamen Ch. Ivanov, Roger G. Mark, Joseph E. Mietus, George B. Moody, Chung-Kang Peng, and H. Eugene Stanley. 2000. PhysioBank, PhysioToolkit, and PhysioNet: Components of a New Research Resource for Complex Physiologic Signals. Circulation 101, 23 (2000), e215–e220.Google ScholarCross Ref
- Hanna Krasowski and Matthias Althoff. 2021. Temporal Logic Formalization of Marine Traffic Rules. In IEEE Intelligent Vehicles Symposium, IV 2021, July 11-17, 2021. IEEE, Nagoya, Japan, 186–192. https://doi.org/10.1109/IV48863.2021.9575685Google ScholarDigital Library
- Oded Maler and Dejan Nickovic. 2004. Monitoring Temporal Properties of Continuous Signals. In Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, September 22-24, 2004, Proceedings(Lecture Notes in Computer Science, Vol. 3253), Yassine Lakhnech and Sergio Yovine (Eds.). Springer, Grenoble, France, 152–166. https://doi.org/10.1007/978-3-540-30206-3_12Google ScholarCross Ref
- Oded Maler, Dejan Nickovic, and Amir Pnueli. 2006. From MITL to Timed Automata. In FORMATS(Lecture Notes in Computer Science, Vol. 4202). Springer, Paris, France, 274–289.Google Scholar
- George B Moody and Roger G Mark. 2001. The impact of the MIT-BIH Arrhythmia Database. IEEE Engineering in Medicine and Biology Magazine 20, 3 (2001), 45–50.Google ScholarCross Ref
- Dogan Ulus, Thomas Ferrère, Eugene Asarin, and Oded Maler. 2014. Timed Pattern Matching. In FORMATS(Lecture Notes in Computer Science, Vol. 8711). Springer, Florence, Italy, 222–236.Google Scholar
- Dogan Ulus, Thomas Ferrère, Eugene Asarin, and Oded Maler. 2016. Online Timed Pattern Matching Using Derivatives. In TACAS(Lecture Notes in Computer Science, Vol. 9636). Springer, Eindhoven, The Netherlands, 736–751.Google Scholar
- Dogan Ulus and Oded Maler. 2018. Specifying Timed Patterns using Temporal Logic. In HSCC. ACM, Porto, Portugal, 167–176.Google Scholar
- Masaki Waga, Takumi Akazaki, and Ichiro Hasuo. 2016. A Boyer-Moore Type Algorithm for Timed Pattern Matching. In FORMATS(Lecture Notes in Computer Science, Vol. 9884). Springer, 121–139.Google Scholar
- Masaki Waga and Étienne André. 2019. Online Parametric Timed Pattern Matching with Automata-Based Skipping. In NFM(Lecture Notes in Computer Science, Vol. 11460). Springer, Houston, TX, USA, 371–389.Google Scholar
- Masaki Waga, Étienne André, and Ichiro Hasuo. 2019. Symbolic Monitoring Against Specifications Parametric in Time and Data. In CAV (1)(Lecture Notes in Computer Science, Vol. 11561). Springer, New York City, NY, USA, 520–539.Google Scholar
- Masaki Waga, Étienne André, and Ichiro Hasuo. 2023. Parametric Timed Pattern Matching. ACM Trans. Softw. Eng. Methodol. 32, 1, Article 10 (feb 2023), 35 pages. https://doi.org/10.1145/3517194Google ScholarDigital Library
Index Terms
- Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions
Recommendations
Timed regular expressions
In this article, we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to the timed automata of Alur and Dill. This result is the timed ...
On Equivalences for a Class of Timed Regular Expressions
Timed regular expressions are an extension of regular expressions that capture a notion of time. Roughly speaking, timed regular expressions can be used to represent timed sequences of events, with new operators to control the duration of those ...
A Perfect Class of Context-Sensitive Timed Languages
DLT 2016: Proceedings of the 20th International Conference on Developments in Language Theory - Volume 9840Perfect languages--a term coined by Esparza, Ganty, and Majumdar--are the classes of languages that are closed under Boolean operations and enjoy decidable emptiness problem. Perfect languages form the basis for decidable automata-theoretic model-...
Comments