arXiv CS
open access
String Diagrams for Process Mining
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 a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- String Diagrams for Process Mining#1034295
- Topological Data Analysis for High-Dimensional Dynamic Process Monitoring#290578
- <i>Network pharmacology analysis</i>#363839
- IANA Considerations for Remote Procedure Call (RPC) Network Identifiers and Universal Address Formats#208950
- On Some Theoretical Aspects of Functional Data Analysis of Parametrized Curves in $\mathbb{R}^p$#1076345
Record · ID 978502
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive