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.
CITATION STYLE
Bertrand, C., Klaudel, H., Latapy, M., & Peschanski, F. (2018). Pattern matching in link streams: A token-based approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10877 LNCS, pp. 227–247). Springer Verlag. https://doi.org/10.1007/978-3-319-91268-4_12
Mendeley helps you to discover research relevant for your work.