Process Discovery Using Integer Linear Programming

DOI10.1007/978-3-540-68746-7_24zbMath1143.68497OpenAlexW2115937275MaRDI QIDQ3510879

Jan Martijn E. M. van der Werf, Alexander Serebrenik, Boudewijn van Dongen, Cor A. J. 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

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

Related Items (11)

Discovering Block-Structured Process Models from Event Logs - A Constructive Approach ⋮ Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ Finding Complex Process-Structures by Exploiting the Token-Game ⋮ Discovering directly-follows complete Petri nets from event data ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Regions of Petri nets with a/sync connections ⋮ Applying regions ⋮ A Study of Quality and Accuracy Trade-offs in Process Mining ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory

Cites Work

• Partial (set) 2-structures. I: Basic notions and the representation problems
• Deriving Petri nets from finite transition systems
• Free Choice Petri Nets
• Polynomial algorithms for the synthesis of bounded nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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