Timed pattern matching
12th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2014, Florence, İtalya, 8 - 10 Eylül 2014, cilt.8711 LNCS, ss.222-236, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 8711 LNCS
- Doi Numarası: 10.1007/978-3-319-10512-3_16
- Basıldığı Şehir: Florence
- Basıldığı Ülke: İtalya
- Sayfa Sayıları: ss.222-236
- Boğaziçi Üniversitesi Adresli: Hayır
Özet
Given a timed regular expression and a dense-time Boolean signal we compute the set of all matches of the expression in the signal, that is, the set of all segments of the signal that satisfy the regular expression. The set of matches is viewed as a set of points in a two-dimensional space with each point indicating the beginning and end of a matching segment on the real time axis. Our procedure, which works by induction on the structure of the expression, is based on the following result that we prove in this paper: the set of all matches of a timed regular expression by a signal of finite variability and duration can be written as a finite union of zones. © 2014 Springer International Publishing Switzerland.