Online Timed Pattern Matching Using Derivatives
Timed pattern matching consists in finding all segments of a dense-time Boolean signal that match a pattern defined by a timed regular expression. This problem has been formulated and solved in  via an offline algorithm that takes the signal and expression as inputs and produces the set of all matches, represented as a finite union of two-dimensional zones. In this work we develop an online version of this approach where the input signal is presented incrementally and the matching is computed incrementally as well.
Naturally, the concept of derivatives of regular expressions due to Brzozowski  can play a role in defining what remains to match after having read a prefix of the signal. However the adaptation of this concept is not a straightforward for two reasons: the dense infinite-state nature of timed behaviors and the fact that we are interested in matching, not only in prefix acceptance. To resolve these issues we develop an alternative theory of signals and expressions based on absolute time and show how derivatives are defined and computed in this setting. We then implement an online timed pattern matching algorithm based on these results.
This work was partially supported by the French ANR projects EQINOCS and CADMIDIA and benefitted from useful comments made by anonymous referees.
- 3.Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: Logic in Computer Science (LICS), pp. 160–171 (1997)Google Scholar
- 8.Giavitto, J.-L., Echeveste, J.: Real-time matching of antescofo temporal patterns. In: Principles and Practice of Declarative Programming (PPDP), pp. 93–104 (2014)Google Scholar
- 9.Havlicek, J., Little, S.: Realtime regular expressions for analog and mixed-signal assertions. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 155–162 (2011)Google Scholar
- 12.Morin-Allory, K., Borrione, D.: On-line monitoring of properties built on regular expressions. In: Forum on specification and Design Languages, (FDL), pp. 249–255 (2006)Google Scholar
- 14.Rosu, G., Viswanathan, M.: Testing extended regular language membership incrementally by rewriting. In: Rewriting Techniques and Applications (RTA), pp. 499–514 (2003)Google Scholar
- 17.Ulus, D., Ferrère, T., Asarin, E., Maler, O.: Timed pattern matching. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 222–236. Springer, Heidelberg (2014)Google Scholar