Discovering Block-Structured Process Models from Incomplete Event Logs

DOI10.1007/978-3-319-07734-5_6zbMath1410.68253DBLPconf/apn/LeemansFA14OpenAlexW2149406428WikidataQ57004819 ScholiaQ57004819MaRDI QIDQ5166758

Dirk Fahland, Sander J. J. Leemans, Wil M. P. van der Aalst

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/107385/3/388703420960833.pdf

zbMATH Keywords

process discoveryblock-structured process modelsprocess treesrediscoverability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Process Discovery Using Localized Events ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ The connection between process complexity of event sequences and models discovered by process mining ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory

Uses Software

• rbminer

Cites Work

• Projection approaches to process mining using region-based techniques
• Free shuffle algebras in language varieties
• Partial (set) 2-structures. II: State spaces of concurrent systems
• On the α-Reconstructibility of Workflow Nets
• On Profiles and Footprints – Relational Semantics for Petri Nets
• Process Mining
• Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
• Process Mining from a Basis of State Regions
• Process Discovery using Integer Linear Programming
• Discovering Block-Structured Process Models from Event Logs - A Constructive Approach
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering Block-Structured Process Models from Incomplete Event Logs