Pattern matching in link streams: A token-based approach

Abstract : 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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01817416
Contributor : Frédéric Davesne <>
Submitted on : Sunday, June 17, 2018 - 8:31:58 PM
Last modification on : Wednesday, March 27, 2019 - 1:34:18 AM

Identifiers

Citation

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-01817416⟩

Share

Metrics

Record views

139