Discovering workflow nets using integer linear programming
From MaRDI portal
Publication:1639990
DOI10.1007/s00607-017-0582-5zbMath1395.90166arXiv1703.06733OpenAlexW2767274788WikidataQ59481995 ScholiaQ59481995MaRDI QIDQ1639990
H. M. W. Verbeek, Sebastiaan J. van Zelst, Boudewijn van Dongen, Wil M. P. van der Aalst
Publication date: 13 June 2018
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.06733
Related Items (8)
Concurrency and objects matter! Disentangling the fabric of real operational processes to create digital twins ⋮ From place nets to local process models ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ Discovering directly-follows complete Petri nets from event data ⋮ The impact of biased sampling of event logs on the performance of process discovery ⋮ Discovering Object-centric Petri Nets ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Soundness of workflow nets: classification, decidability, and analysis
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Conformance checking and diagnosis in process mining. Comparing observed and modeled processes
- Towards Synthesis of Petri Nets from Scenarios
- Process Discovery using Integer Linear Programming
- The Synthesis Problem
- Polynomial algorithms for the synthesis of bounded nets
- Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
This page was built for publication: Discovering workflow nets using integer linear programming
