Process Model Discovery: A Method Based on Transition System Decomposition

DOI10.1007/978-3-319-07734-5_5zbMATH Open1410.68252OpenAlexW89053805WikidataQ57004846 ScholiaQ57004846MaRDI QIDQ5166757FDOQ5166757

A. A. Kalenkova, W. M. P. van der Aalst, Irina A. Lomazova

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://doi.org/10.1007/978-3-319-07734-5_5

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)

Cites Work

• Title not available (Why is that?)
• Process Mining
• New Region-Based Algorithms for Deriving Bounded Petri Nets
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Process Discovery using Integer Linear Programming
• Decomposing Process Mining Problems Using Passages
• Process Mining from a Basis of State Regions
• Discovery of Cancellation Regions within Process Mining Techniques

Cited In (2)

• PALM: A Technique for Process ALgebraic Specification Mining
• Generation of synchronizing state machines from a transition system: a region-based approach

Uses Software

• rbminer
• YAWL
• ProM

This page was built for publication: Process Model Discovery: A Method Based on Transition System Decomposition

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