Pattern Matching in Link Streams: a Token-based Approach - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Pattern Matching in Link Streams: a Token-based Approach


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
petrinets.pdf (678.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02112087 , version 1 (26-04-2019)



Clément Bertrand, Hanna Klaudel, Matthieu Latapy, Frédéric Peschanski. Pattern Matching in Link Streams: a Token-based Approach. 39th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2018), Jun 2018, Bratislava, Slovakia. pp.227--247, ⟨10.1007/978-3-319-91268-4_12⟩. ⟨hal-02112087⟩
106 View
75 Download



Gmail Facebook Twitter LinkedIn More