Metraipolis › archive › dc_40f69fcfb7bd

String Diagrams for Process Mining — arXiv:2609.20478

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20478
License (as archived)
CC0-1.0
Archived
2026-10-10T05:39:26.184Z
SHA-256 of the archived text
84e3fd662cfcd76f975be06d3adebf907ba322ceb511b33f39ddf357578959a4
Stable URL of this page
https://metraipolis.com/documento/dc_40f69fcfb7bd

How to cite

String Diagrams for Process Mining — arXiv:2609.20478 — arXiv (en), https://arxiv.org/abs/2609.20478 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_40f69fcfb7bd (Metraipolis archive dc_40f69fcfb7bd, sha256 84e3fd662cfcd76f975be06d3adebf907ba322ceb511b33f39ddf357578959a4)
BibTeX
@misc{dc40f69fcfb7bd,
  title = {String Diagrams for Process Mining — arXiv:2609.20478},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20478},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_40f69fcfb7bd; sha256 84e3fd662cfcd76f975be06d3adebf907ba322ceb511b33f39ddf357578959a4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20478. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Run two process-discovery algorithms on the same event log and they return two different pictures of the same process. Petri nets, causal nets, process trees and BPMN each rely on routing machinery of their own, and their only common ground is the traces they generate. A trace lists activities one after another, so it discards the concurrency the notations exist to express, and two models with identical trace languages can describe genuinely different processes. Whether two discovered models mean the same thing therefore has no notation-independent answer. We show that all four notations admit one canonical presentation, a signature recording a model's activities and the typed interfaces along which they compose, and nothing of the routing machinery. Four construction theorems establish this presentation notation by notation, so two models are compared in a form that each notation determines on its own. Signature equality implies trace equivalence and is strictly finer, separating genuine concurrency from interleaved choice, which a trace comparison cannot, and signature inclusion implies trace inclusion. In a recovery study on one object-centric log, the discovered causal net has exactly the ground-truth signature, while the discovered Petri net's signature strictly contains it and locates every behaviour the Petri net adds in its silent structure. The gain is largest for object-centric data, where a single log supports several notations at once. The four notations become one calculus, in which a translation between them is a claim that can be checked.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DB).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Databases (cs.DB); Category Theory (math.CT).
Pagina del lavoro: https://arxiv.org/abs/2609.20478 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T05:05:31.052Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).