arXiv (All)
open access
Computational Complexity of Alignments
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute one of the most important conformance checking techniques. We study the algorithmic complexity of computing alignments over important classes of Petri nets. Firs
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
- Mind the Long Tail: Understanding the Difficulty of Delay Detection in Business Processes#458281
- Fixing the Fixpoint: A Formal Theory of Convergence Detection for Incremental Recursive Computation#1169672
- Fixing the Fixpoint: A Formal Theory of Convergence Detection for Incremental Recursive Computation#1155465
- Information Flow Paths from RTL Traces#271709
- Robustness to Fundamental Uncertainty in AGI Alignment#777954
Record · ID 1142636
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