Process Discovery Using Integer Linear Programming

DOI10.1007/978-3-540-68746-7_24MaRDI QIDQ3510879zbMATH OpenOpenAlexFDO

Authors Jan Martijn E. M. van der Werf, Alexander Serebrenik, Boudewijn van Dongen, Cor Hurkens

Publication date 3 July 2008

Published in Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/86122de1-5a29-4117-b27e-0e07a197fbdb

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Integer programming (90C10)

Recommendations

• Process discovery using integer linear programming
• Process discovery and Petri nets
• Discovering workflow nets using integer linear programming
• Discovering Petri nets from event logs
• Incremental process discovery using Petri net synthesis

Cites work

• Deriving Petri nets from finite transition systems
• Free Choice Petri Nets
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• scientific article; zbMATH DE number 1305001 (Why is no real title available?)
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Polynomial algorithms for the synthesis of bounded nets

Cited in

(25)

• Discovering workflow nets using integer linear programming
• Discovering stochastic process models by reduction and abstraction
• Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
• Optimising business process discovery using answer set programming
• A study of quality and accuracy trade-offs in process mining
• Petri Net Synthesis for Restricted Classes of Nets
• An SMT-based discovery algorithm for C-nets
• Causal nets: a modeling language tailored towards process discovery
• Unfolding-based process discovery
• Discovery, Verification and Conformance of Workflows with Cancellation
• Construction of Process Models from Example Runs
• Process discovery using integer linear programming
• Process discovery and Petri nets
• Incremental process discovery using Petri net synthesis
• Discovering Petri nets from event logs
• Automated repair of process models with non-local constraints using state-based region theory
• Automated repair of process models using non-local constraints
• Discovering block-structured process models from event logs -- a constructive approach
• Finding Complex Process-Structures by Exploiting the Token-Game
• Discovering directly-follows complete Petri nets from event data
• ILP\textsuperscript{2} Miner -- process discovery for partially ordered event logs using integer linear programming
• Orbit-finite linear programming
• Robust solutions via optimisation and predictive process monitoring for the scheduling of the interventional radiology procedures
• Regions of Petri nets with a/sync connections
• Applying regions

This page was built for publication: Process Discovery Using Integer Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510879)