Online Timed Pattern Matching using Automata

Abstract : We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal w that match a given temporal pattern phi. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by phi and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads w, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.
Type de document :
Communication dans un congrès
16th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), Sep 2018, Beijing, China
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01825026
Contributeur : Alexey Bakhirkin <>
Soumis le : jeudi 28 juin 2018 - 01:23:48
Dernière modification le : jeudi 15 novembre 2018 - 20:27:45
Document(s) archivé(s) le : jeudi 27 septembre 2018 - 04:25:05

Fichier

formats18.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01825026, version 1

Collections

Citation

Alexey Bakhirkin, Thomas Ferrère, Dejan Nickovic, Oded Maler, Eugène Asarin. Online Timed Pattern Matching using Automata. 16th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS), Sep 2018, Beijing, China. 〈hal-01825026〉

Partager

Métriques

Consultations de la notice

20

Téléchargements de fichiers

16