Pattern Matching in Link Streams: Timed-Automata with Finite Memory - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Scientific Annals of Computer Science Année : 2018

Pattern Matching in Link Streams: Timed-Automata with Finite Memory

Résumé

Link streams model the dynamics of interactions in complex distributed systems as sequences of links (interactions) occurring at a given time. Detecting patterns in such sequences is crucial for many applications but it raises several challenges. In particular, there is no generic approach for the specification and detection of link stream patterns in a way similar to regular expressions and automata for text patterns. To address this, we propose a novel automata framework integrating both timed constraints and finite memory together with a recognition algorithm. The algorithm uses structures similar to tokens in high-level Petri nets and includes non-determinism and concurrency. We illustrate the use of our framework in real-world cases and evaluate its practical performances.
Fichier principal
Vignette du fichier
SACS.pdf (774.97 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02110475 , version 1 (25-04-2019)

Identifiants

Citer

Clément Bertrand, Frédéric Peschanski, Hanna Klaudel, Matthieu Latapy. Pattern Matching in Link Streams: Timed-Automata with Finite Memory. Scientific Annals of Computer Science, 2018, 28 (36), pp.161-198. ⟨10.7561/SACS.2018.2.161⟩. ⟨hal-02110475⟩
80 Consultations
61 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More